原题链接:http://www.tyvj.cn/p/1036
简单题,具体如下:
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define Max_N 210000
int rec[Max_N];
int cmp(const void *a, const void *b){
return *(int *)a - *(int *)b;
}
int main(){
#ifdef LOCAL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w+", stdout);
#endif
int i = 0, n;
scanf("%d", &n);
while (n--) scanf("%d", &rec[i++]);
int k = 0;
qsort(rec, i, sizeof(rec[0]), cmp);
while (k < i){
int t = 0, x = rec[k];
for (; x == rec[k]; k++) t++;
printf("%d %d\n", x, t);
}
return 0;
}