顺序容器2

#include<vector>
#include<deque>
#include<algorithm>
#include<iterator>
#include<iostream>
using namespace std;
int main()
{
istream_iterator<int>i1(cin),i2;
vector<int>s1(i1,i2);
sort(s1.begin(),s1.end());
deque<int>s2;
for(vector<int>::iterator iter=s1.begin();iter !=s1.end();++iter){
if(*iter%2==0)
s2.push_back(*iter);
else
s2.push_front(*iter);
}
copy(s2.begin(),s2.end(),ostream_iterator<int>(cout," "));
cout<<endl;
return 0;
}