Multiset
This is a Set that is also ordered, the benefits is that you can store duplicates.
// empty multiset container
multiset<int, greater<int> > gquiz1;
// insert elements in random order
gquiz1.insert(40);
gquiz1.insert(50);
gquiz1.insert(50); // 50 will be added again to the multiset unlike set
gquiz1.insert(10);
In the for loop, it will print x multiple times.
for (auto x: s) {
cout << x << endl;
}
MATH239
Definition 1.8. Let and be integers. A multiset of size with elements of types is a sequence of nonnegative integers such that
Theorem 1.9. For any and , the number of -element multisets with elements of types is