using namespace std;


int main()
{
  vec_multiset<int> vms;
  
  // "setup" phase ... populate our container
  
  vms.insert(23);
  vms.insert(94);
  vms.insert(76);
  vms.insert(10);
  vms.insert(91);
  vms.insert(12);
  vms.insert(76);
  
  // more inserts here
  // ...
   
  // "lookup" phase ... use our container to find different elements

  // print out container elements ... they'll appear in sorted order
  
  cout << "Container elements: " << endl;

  copy(vms.begin(), vms.end(), ostream_iterator<int>(cout, " "));
  cout << endl;

  if (vms.find(12) != vms.end())
cout << "Found element with value 12" << endl; else cout << "Could not find element with value 12" << endl; pair<vec_multiset<int>::iterator, vec_multiset<int>::iterator> pr = vms.equal_range(76); cout << "Elements with value 76: " << endl; copy(pr.first, pr.second, ostream_iterator<int>(cout, " ")); cout << endl; // more lookups here, possibly calls to vms.lower_bound(), vms.count(), etc. return 0; }