
#include <iostream>
using namespace std;
int main()
{
int n,i,j,t;
int a[50];
int cnt = 0;
cin >> n;
for(i=0;i<n;i++)
cin >> a[i];
//排序
for (i=0;i<n-1;i++)
{
for(j=0;j<n-1-i;j++)
{
if(a[j] < a[j+1])
{
t= a[j];
a[j] = a[j+1];
a[j+1]=t;
}
}
}
cnt = 1;
for (i=1;i<n;i++)
{
if(a[i] != a[i-1])
{
cout << a[i-1] << " " << cnt << endl;
cnt = 1;
}
else
cnt++;
}
cout << a[n-1] <<" " << cnt << endl;
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int a[50];
int n;
int count = 0;
while(count<50 && cin>>n)
{
a[count++] = n;
}
for(int i=0;i<count-1;i++)
for(int j=0;j<count-i-1;j++)
{
if(a[j] < a[j+1])
{
int t = a[j];
a[j] = a[j+1];
a[j+1] = t;
}
}
cout<<"N\tCount"<<endl;
int d = a[0];
int c = 1;
for(int i=1;i<count;i++)
{
if(a[i] == d)
c++;
else
{
cout<<d<<"\t"<<c<<endl;
c=1;
d = a[i];
}
}
cout<<d<<"\t"<<c<<endl;
return 0;
}