#include <queue>
#include <vector>
#include <algorithm>
#include <iostream>

typedef queue<int> QueueInt;
typedef vector<int> VecInt;
typedef VecInt::iterator ItVecInt;
int main(void)
{
  QueueInt que;
  VecInt vec;
  int i;

  que.push(10);
  que.push(15);
  que.push(20);

  cout << que.front() << endl;
  que.pop();
  cout << que.front() << endl;
  que.pop();
  cout << que.front() << endl;

  /* the output would be
10
15
20
  */

  vec.push_back(15);
  vec.push_back(2);
  vec.push_back(47);
  cout << "There are " << vec.size() << " integers, they are:\n";
  for (i=0; i<vec.size(); i++)
    cout << "vec[" << i << "]=" << vec[i] << endl;
  
  sort(vec.begin(),vec.end());
  cout << "After sort:\n";
  for (i=0; i<vec.size(); i++)
    cout << "vec[" << i << "]=" << vec[i] << endl;

  /* the output would be:
There are 3 integers, they are:
vec[0]=15
vec[1]=2
vec[2]=47
After sort:
vec[0]=2
vec[1]=15
vec[2]=47
  */
  
  return 0;
}