#include<stdio.h>
#include<algorithm>
using namespace std;
struct e{
int shuzhi;
int cishu;
}buf[1001];
bool cmp(e a, e b){
if(a.cishu!=b.cishu)return a.cishu>b.cishu;
else return a.shuzhi<b.shuzhi;
}
int main (){
int n,i,x;
for(i=0;i<1001;i++){
buf[i].cishu=0;
buf[i].shuzhi=i;
}
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&x);
buf[x].cishu++;
}
sort(buf,buf+1001,cmp);
for(i=0;i<1001;i++){
if(buf[i].cishu==0){
break;
}
printf("%d %d\n",buf[i].shuzhi,buf[i].cishu);
}
return 0;
#include<algorithm>
using namespace std;
struct e{
int shuzhi;
int cishu;
}buf[1001];
bool cmp(e a, e b){
if(a.cishu!=b.cishu)return a.cishu>b.cishu;
else return a.shuzhi<b.shuzhi;
}
int main (){
int n,i,x;
for(i=0;i<1001;i++){
buf[i].cishu=0;
buf[i].shuzhi=i;
}
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&x);
buf[x].cishu++;
}
sort(buf,buf+1001,cmp);
for(i=0;i<1001;i++){
if(buf[i].cishu==0){
break;
}
printf("%d %d\n",buf[i].shuzhi,buf[i].cishu);
}
return 0;
}
注释:
运用了结构体数组 使得每个数字出现次数和数值得以记录;
定义了排序规则 运用sort(buf,buf+n,cmp)格式;