Sukat

input/code.cpp: In function 'int main()':
input/code.cpp:84:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<char, char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for (int i = 0; i < combs.size(); ++i) {
      |                     ~~^~~~~~~~~~~~~~

#include "bits/stdc++.h"

typedef long long ll;

using namespace std;

int main() {
    string in;
    cin >> in;

    //ll size = in.size();
    //cout << size << endl;

    deque<pair<char, int>> q;
    map<char, int> mp;
    for (char& c : in) {
        if(c)
        mp[c] += 1;
    }
    bool done = false;
    while (!done) {
        ll largest = 0;
        pair<char,int> obj;
        for(auto b : mp) {
            if (b.second > largest) {
                largest = b.second;
                obj = b;
            }
        }
        mp.erase(obj.first);
        q.push_back(obj);
        if(mp.size() == 0) {
            done = true;
        }
    }

    vector<pair<char, char>> combs;

    deque<pair<char, int>> r = q;

    /*while (!r.empty()) {
        pair<char, int> p = r.front();

        char c = p.first;
        int n = p.second;
        cout << c << ": " << n << endl;
        r.pop_front();
    }
    return 0;*/

    while (!q.empty()) {
        pair<char, int> p = q.front();

        char c = p.first;
        int n = p.second;
        //cout << c << ": " << n << endl;
        q.pop_front();

        while (n > 0) {
            if(q.empty()) {
                break;
            }
            auto b = q.front();
            int j = b.second;
            //cout << "g  " << b.first << ": " << b.second << endl;
            
            combs.push_back(make_pair(c, b.first));
            n -= 1;
            j -= 1;

            q.pop_front();

            if(j > 1) {
                q.push_front(make_pair(b.first, j));
            } else if (j == 1) {
                q.push_back(make_pair(b.first, j));
            }
            if(q.empty()) {
                break;
            }
        }
    }
    cout << (combs.size()) << endl;
    for (int i = 0; i < combs.size(); ++i) {
        string test;
        test += combs[i].first;  
        test += combs[i].second;
        cout << test << endl;
    }
    //cout << max << endl;
    return 0;
}

/*
AAAAAAAAAA
BBBBBBBB
CC
DD
EE
FF
GG
HH

AAAAAAAAAABBBBBBBBCCDDEEFFGGHH
*/

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: WRONG ANSWER

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