STL_deque

#include<iostream>
#include<algorithm>
#include<deque>
#include<string>
//#include <vector>
#include <map>
//#include <set>

using namespace std;

void main(){
   deque<char>a;
   for(int i=0;i<5;a.push_back('5'-i++));

   cout<<"size::"<<a.size()<<endl;
   a.push_front('0');

   cout<<"size::"<<a.size()<<endl;
   for( i=0;i<(int)a.size();cout<<a[i++]<<",");
   cout<<endl;

   sort(a.begin(),a.end(),less<char>());
   cout<<"size()::"<<a.size()<<endl;
   for( i=0;i<(int)a.size();cout<<a[i++]<<",");
   
   cout<<endl;
   a.clear();
   cout<<"size::"<<a.size()<<endl;


}