Karuselli

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

#define F first
#define S second

int n, k;

int main() {
    cin >> n >> k;
    
    vector<pair<int, int>> v[2];
    
    for (int i = 0; i < min(n, 2); ++i) {
        for (int j = 0; j < k; ++j) {
            int cur;
            cin >> cur;
            v[i].push_back(make_pair(cur, j));
        }
        sort(v[i].begin(), v[i].end());
    } 
    
    auto p1p = *(v[0].end()-1);
    auto p1s = *(v[0].end()-2);
    
    auto p2p = *(v[1].end()-1);
    auto p2s = *(v[1].end()-2);
    
    if (p1p.S != p2p.S) {
        cout << p1p.F+p2p.F << "\n";
    }
    else {
        cout << max(p1p.F+p2s.F, p1s.F+p2p.F) << "\n";
    }
    return 0;
}

Test 1

Group: 1

Verdict: RUNTIME ERROR

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: RUNTIME ERROR

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: RUNTIME ERROR

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER