洛谷 1097 统计数字（NOIp2007提高组T1）

 1 #include<cstdio>
 2 #include<algorithm>
 3 #include<cstring>
 4 #define LL long long
 5 #define rg register
 6 #define N 200010
 7 using namespace std;
 8 int n,a[N],cnt=1;
 9 inline int read(){
10     int k=0,f=1; char c=getchar();
11     while(c<‘0‘||c>‘9‘)c==‘-‘&&(f=-1),c=getchar();
12     while(‘0‘<=c&&c<=‘9‘)k=k*10+c-‘0‘,c=getchar();
13     return k*f;
14 }
15 int main(){
16     n=read();
17     for(rg int i=1;i<=n;i++) a[i]=read();
18     sort(a+1,a+1+n);
19     for(rg int i=2;i<=n+1;i++){
20         if(a[i]!=a[i-1]){
21             printf("%d %d\n",a[i-1],cnt);
22             cnt=0;
23         }
24         cnt++;
25     }
26     return 0;
27 }