Problem F: 神偷TMK
Description
Input
Output
Sample Input
Sample Output
HINT
#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
struct Tnode
{
char ch;
int num;
} a[1005];
bool cmp(Tnode a,Tnode b)
{
return a.num>b.num;
}
int t[1005];
int main()
{
//freopen("a.in","r",stdin);
//freopen("a.out","w",stdout);
string st="abhcujzqacehbfjkbacxmcnjkaecfiallcxcbbcad";
int len=st.length();
for (int i=0;i<len;i++)
{
t[st[i]]++;
}
int num=0;
for (char i='a';i<='z';i++)
{
a[++num].ch=i;
a[num].num=t[i];
}
sort(a+1,a+num+1,cmp);
// for (int i=1;i<=num;i++)
// printf("%c %d\n",a[i].ch,a[i].num);
// printf("%c %d\n",a[1].ch,a[1].num);
// printf("%c %d\n",a[2].ch,a[2].num);
printf("%c\n",a[1].ch);
printf("%c\n",a[2].ch);
return 0;
}