#include <cstdio>
#include <cstring>
struct prsn{
    char name[25];
    char mssg[205];
    int cnt;
};
int main(){
    int n, max = 0;
    prsn a[105];
    scanf("%d", &n);
    for(int i = 0; i < n; i++){
        scanf(" %s %s", a[i].name, a[i].mssg);
        a[i].cnt = 0;
        for(int j = 0; j < strlen(a[i].mssg) - 2; j++){
            if(a[i].mssg[j] == 's' && a[i].mssg[j + 1] == 'o' && a[i].mssg[j + 2] == 's'){//从这行
                a[i].cnt++;
                j++;
            }
        }
        if(max < a[i].cnt){
            max = a[i].cnt;//到这行
        }
    }
    for(int i = 0; i < n; i++){
        if(max == a[i].cnt){
            printf("%s ", a[i].name);
        }
    }
    printf("\n%d", max);
    return 0;
}

我把加了注释的两行之间注释掉（都包括）给注释掉了，用#8的样例测试，在其中几行停顿了亿一下，已经无限趋近于TLE了