跟学弟一起做的一个水题……
我还是好弱啊……QAQ
#include <cstdio>
#include <cstring>
#include <iostream>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int MAXN = 101;
string s[MAXN];
struct QIQIU{
int num;
string ss;
}Q[MAXN];
bool cmp(QIQIU A,QIQIU B)
{
return A.num>B.num;
}
int main()
{
int n;
cin >> n;
for(int i = 1; i <= n; ++ i)
cin >> s[i];
sort(s+1, s+n+1);
int tot = 0;
for(int i = 1; i <= n; ++ i)
{
if(s[i] != Q[tot].ss)
{
tot ++;
Q[tot].ss = s[i];
Q[tot].num = 1;
}
else Q[tot].num ++;
}
sort(Q+1, Q+tot+1, cmp);
cout << tot << endl;
for(int i = 1; i <= tot; ++ i)
{
if(Q[i].num != Q[i-1].num)
cout << Q[i].num << endl;
cout << Q[i].ss << endl;
}
return 0;
}