第1个回答 推荐于2016-01-16
#include "stdafx.h"
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
using namespace std;
int main()
{
vector<int> data;
vector<int>::iterator dataIt;
for(int i = 0; i < 10; i++)
{
data.push_back(i);//插入到vector末尾
}
cout<<"排序前的vector:";
for(dataIt = data.begin(); dataIt != data.end(); dataIt++)
{
cout<<*dataIt <<" ";
}
cout <<endl;
sort(data.begin(), data.end(), greater<int>());//降序
cout <<"排序后的vector:" ;
for(dataIt = data.begin(); dataIt != data.end(); dataIt++)
{
cout<<*dataIt <<" ";
}
cout <<endl;
return 0;
}本回答被提问者采纳