ЕГЭ 24

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int,int>
#define vec vector
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvl(vector <ll> &v){
    for (auto x: v) cout<<x<<' ';
    cout<<"\n";
}


void cvv(vector <vector <int> > &v){
    for (auto x: v) cv(x);
    cout<<"\n";
}

void cvb(vector <bool> v){
    for (bool x: v) cout<<x<<' ';
    cout<<"\n";
}

void cvs(vector <string>  v){
    for (auto a: v){
        cout<<a<<"\n";
    }
}

void cvp(vector <pii> a){
    for (auto p: a){
        cout<<p.first<<' '<<p.second<<"\n";
    }
    cout<<"\n";
}
#include <fstream>

bool cmp(pair <char, int> a, pair <char, int> b){
    return a.second > b.second || a.second == b.second && a.first > b.first;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    ifstream fl("24.txt");
    vector <string> v;
    string s;
    while (getline(fl, s)) v.push_back(s);
    int mx = -1;
    for (string s: v){
        mx = max(mx, (int)count(s.begin(), s.end(), 'G'));
    }
    for (string t: v){
        if (count(t.begin(), t.end(), 'G') == mx){
            s = t;
            break;
        }
    }
    map <char, int> l;
    for (char i: s){
        l[i]++;
    }
    vector <pair <char, int> > a(l.begin(), l.end());
    sort(a.begin(), a.end(), cmp);
    for (auto p: a){
        //cout<<p.first<<' '<<p.second<<"\n";
    }
    cout<<a[0].first;
}