T2
输入n个数,从小到大输出每个数出现的次数。
n<=50000,每个数<=2000000000.
题解
水题一个,排序后统计输出即可。
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<queue>
#include<deque>
#include<map>
using namespace std;
int a[50005],cnt,n;
int main(){
freopen("count.in","r",stdin);
freopen("count.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
sort(a+1,a+n+1);
int cnt=0;
a[0]=-1;
a[n+1]=-1;
for(int i=1;i<=n;i++){
if(a[i]!=a[i-1]){
printf("%d ",a[i]);
cnt=0;
}
cnt++;
if(a[i]!=a[i+1]){
printf("%d\n",cnt);
}
}
return 0;
}