【小码匠自习室】[NOI Online 2020-3 入门组] 最急救助：被“幸运女神”眷顾的人

2
adam
ineedhelpsosineedhelpsos
mark
ineedmorehelpsoshelpmesossoshelpme

mark
3

3
susan
sosososososos
jack
sossossossos
allen
soshelpsossossossossos

susan allen
6

void coder_solution() {

    // 提升cin、cout效率
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    cin >> n;
    string s;
    vector<pair<int, string>> vpi(n);
    for(int i = 0; i < n; ++i) {
        cin >> vpi[i].second;
        cin >> s;
        for(int j = 0; j < s.size(); ++j) {
            if(s[j] == 's' && s[j + 1] == 'o' && s[j + 2] == 's') {
                vpi[i].first++;
            }
        }
    }
    sort(vpi.begin(), vpi.end(), greater<pair<int, string>>());
    int max = vpi[0].first;
    for(int i = 0; i < n; ++i) {
        if(vpi[i].first == max) {
            cout << vpi[i].second << "";
        } else{
            break;
        }
    }
    cout << endl;
    cout << max;
}

void coder_solution() {

    // 提升cin、cout效率
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n;
    cin >> n;
    string s;
    vector<pair<int, string>> vpi(n);
    int max_num = 0;
    for(int i = 0; i < n; ++i) {
        cin >> vpi[i].second;
        cin >> s;
        for(int j = 0; j < s.size(); ++j) {
            if(s[j] == 's' && s[j + 1] == 'o' && s[j + 2] == 's') {
                vpi[i].first++;
            }
        }
        max_num = max(max_num, vpi[i].first);
    }

    for(int i = 0; i < n; ++i) {
        if(vpi[i].first == max_num) {
            cout << vpi[i].second << " ";
        }
    }
    cout << endl;
    cout << max_num;
}