#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
vector<int> a;
a.push_back(8);
a.push_back(17);
a.push_back(3);
a.push_back(1);
a.push_back(6);
a.push_back(98);
a.push_back(4);
cout<<"the min number is: "<<*min_element(a.begin(),a.end())<<endl;
cout<<"the min location is: "<<distance(a.begin(),min_element(a.begin(),a.end()))<<endl;
cout<<"the max number is: "<<*max_element(a.begin(),a.end())<<endl;
cout<<"the max location is: "<<distance(a.begin(),max_element(a.begin(),a.end()))<<endl;
vector<int>::iterator itor;
a.erase(a.begin()+4);
for(int i=0;i<a.size();i++)
{
cout<<a[i]<<endl;
}
system("pause");
return 0;
}
找出向量中最大值 最小值 及其对应的位置