// Demonstrating how the deque is efficient than the vector at front operations.
#include <iostream>
#include <iterator>
#include <vector>
#include <deque>

void main()
{
	std::deque<int> v;
	//std::vector<int> v;
	for(int i = 0; i < 1000000; i++)
		v.insert(v.begin(),i);
	for(int i = 0; i < 1000000; i++)
		v.erase(v.begin());
}