#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
bool comp(int& r1, int& r2);
void myfind(vector<int>::iterator& beg
, vector<int>::iterator& end,int& val);
int main(void)
{
vector<int> ivec(10);
int t;
for (size_t i = 0; i < 10; ++i)
{
cin >> t;
ivec.at(i) = t;
}
vector<int> iv2(ivec);
sort(iv2.begin(), iv2.end(), comp);
auto pend = unique(iv2.begin(), iv2.end());
iv2.erase(pend, iv2.end());
for (vector<int>::iterator it = iv2.begin(); it != iv2.end(); ++it)
{
cout << *it << " ";
cout << count(ivec.begin(), ivec.end(), *it) << " ";
myfind(ivec.begin(),ivec.end(),*it);
cout << endl;
}
system("pause");
return 0;
}
bool comp(vector<int>::value_type& r1, vector<int>::value_type& r2)
{
return r1 > r2;
}
void myfind(vector<int>::iterator& beg
, vector<int>::iterator& end,int& val)
{
for (vector<int>::iterator it = beg; it != end; ++it)
{
if (val == *it)
cout << (it - beg) << " ";
}
}
升本考试中一题(依次输出最大数,出现次数,出现位置,次大数,出现次数,出现位置.......直至处理完毕)
最新推荐文章于 2022-01-31 09:01:14 发布