wa了一个点一直没过
代码如下
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define size 105
using namespace std;
struct namm{
char name[25];
char ch[205];
int num;
}w[size];
int n;
int numm=0;
bool cmp(namm x,namm y)
{
return x.num>y.num;
}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
cin>>w[i].name;
cin>>w[i].ch;
int s=strlen(w[i].ch);
for(int j=0;j<s-2;j++)
{
if(w[i].ch[j]=='s'&&w[i].ch[j+1]=='o'&&w[i].ch[j+2]=='s')
{
w[i].num++;
}
}
}
sort(w+1,w+n+1,cmp);
int i=1;
int s=strlen(w[i].name);
for(int j=0;j<s;j++)
{
cout<<w[i].name[j];
}
cout<<" ";
i++;
while(w[i].num==w[i-1].num)
{
s=strlen(w[i].name);
for(int j=0;j<s;j++)
{
cout<<w[i].name[j];
}
cout<<" ";
i++;
}
cout<<endl<<w[1].num;
return 0;
}