Sukat

input/code.cpp: In function 'int main()':
input/code.cpp:19:20: warning: array subscript has type 'char' [-Wchar-subscripts]
   19 |         counts[s[i]]++;
      |                    ^
input/code.cpp:18:13: warning: unused variable 'k' [-Wunused-variable]
   18 |         int k = s[i];
      |             ^
input/code.cpp:28:24: warning: array subscript has type 'char' [-Wchar-subscripts]
   28 |         if (counts[s[i]] == 0) continue;
      |                        ^
input/code.cpp:33:36: warning: array subscript has type 'char' [-Wchar-subscripts]
   33 |             if (counts[a] > counts[maxx]) {
      |                                    ^~~~
input/code.cpp:37:20: warning: array subscript has type 'char' [-Wchar-subscripts]
   37 |         if (counts[maxx] == 0) break;
      |                    ^~~~
input/code.cpp:39:16: warning: array subscript has type 'char' [-Wchar-subscripts]
   39 |         counts[maxx]--;
      |                ^~~~
input/code.cpp:40:20: warning: array su...

#include <bits/stdc++.h>
using namespace std;

int counts[1000];
vector<pair<char,char>> ans;

int main() {
    //ifstream in("input.txt");
    //cin.rdbuf(in.rdbuf());

    string s; cin >> s;
    int n = s.length();
    map<char,int> m;

    
    for (int i = 0; i < n; i++)
    {
        int k = s[i];
        counts[s[i]]++;
    }
    for (int a = 'A'; a <= 'Z'; a++) {
        m[a] = counts[a];
    }

    int total = 0;
    for (int i = 0; i < n; i++)
    {
        if (counts[s[i]] == 0) continue;

        char maxx = 0;
        for (int a = 'A'; a <= 'Z'; a++) {
            if (a == s[i]) continue;
            if (counts[a] > counts[maxx]) {
                maxx = a;
            }
        }
        if (counts[maxx] == 0) break;

        counts[maxx]--;
        counts[s[i]]--;

        ans.push_back({s[i], maxx});
        total++;
        /*
        pair<const char, int> p = *m.begin();
        cout << p.first << " " << p.second << endl;

        if (p.second == 0) break;

        if (p.first == s[i]) {
            auto l = m.begin();
            l++;
            auto p2 = *l;
            if (p2.second == 0) continue;
        }
        ans.push_back({s[i], p.first});
        total++;

        m[p.first] = m[p.first] - 1;
        m[s[i]] = m[s[i]] - 1;
        */
    }
    cout << total << endl;
    for (size_t i = 0; i < total; i++)
    {
        cout << ans[i].first << ans[i].second << "\n";
    }
    
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 2, 3

Verdict: ACCEPTED

Test 12

Group: 2, 3

Verdict: ACCEPTED

Test 13

Group: 2, 3

Verdict: ACCEPTED

Test 14

Group: 2, 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED

Test 17

Group: 3

Verdict: ACCEPTED

Test 18

Group: 3

Verdict: ACCEPTED

Test 19

Group: 3

Verdict: ACCEPTED

Test 20

Group: 3

Verdict: ACCEPTED

Test 21

Group: 3

Verdict: ACCEPTED