#include <iostream>
#include<algorithm>
using namespace std;
bool compare(int a, int b)
{
return a > b;
}
int main()
{
int n;
cin >> n;
int num[n];
for (int i = 0;i < n;i++)
cin >> num[i];
sort(num, num + n);
int cnt[1000];
for (int i = 0;i < 1000;i++)
cnt[i] = 0;
for (int i = 0;i < n;i++)
{
if (i == 0)
{
cnt[num[i]] = 1;
}
if (i != 0 && num[i] == num[i - 1])
{
cnt[num[i]]++;
}
if (i != 0 && num[i] != num[i - 1])
{
cnt[num[i]] = 1;
}
}
int copy[1000];
for (int i = 0;i < 1000;i++)
copy[i] = cnt[i];
sort(copy, copy + 1000, compare);
for (int i = 0;i < n;i++)
{
if (copy[i] != 0)
{
for (int j = 0;j < 1000;j++)
{
if (cnt[j] == copy[i])
{
cout << j << " " << cnt[j] << endl;
cnt[j] = 0;
}
}
}
}
return 0;
}
20150302---数字排序
最新推荐文章于 2020-03-26 18:19:04 发布