记录出现次数,然后自定义排序即
不知道为什么,DEV下编译不通过,但是提交还是对的
#include<iostream>
#include<sstream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<ctime>
#include<algorithm>
using namespace std;
#define _for(i,lo,hi) for(int i=(lo);i<(hi);i++)
void printvec(vector<int>& vec){
printf("%d",vec[0]);
for(int i=1;i<vec.size();i++){
printf(" %d",vec[i]);
}
printf("\n");
}
struct node{
int x,cnt;
node(){ }
node(int xx,int cc):x(xx),cnt(cc){ }
bool operator<(node& b){
return cnt>b.cnt||(cnt==b.cnt&&x<b.x);
}
};
int main() {
//freopen("d:\\input.txt","r",stdin);
//freopen("d:\\output.txt","w",stdout);
map<int,int> mmap;
vector<node> vec;
int n,t;
cin>>n;
_for(i,0,n){
cin>>t;
if(mmap.count(t)!=0)mmap[t]++;
else mmap[t]=1;
}
for(map<int,int>::iterator it=mmap.begin();it!=mmap.end();it++){
vec.push_back(node(it->first,it->second));
//printf("%d %d\n",it->first,it->second);
}
sort(vec.begin(),vec.end());
_for(i,0,vec.size())printf("%d %d\n",vec[i].x,vec[i].cnt);
return 0;
}