Karuselli

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

int main()
{
    int n, k;
    cin >> n >> k;

    vector<vector<pair<int, int>>> v(n);
    for(int i = 0; i < n; i++){
        v[i].resize(k);
        for(int j = 0; j < k; j++){
            int num;
            cin >> num;
            v[i][j] = make_pair(num, j);
        }
        sort(v[i].begin(), v[i].end());
    }

    if(n == 1){
        cout << v[0][k - 1].first;
    }
    else if(v[0][k-1].second != v[1][k-1].second){
        cout << (v[0][k-1].first + v[1][k-1].first);
    }else{
       cout << max(v[0][k-1].first + v[1][k-2].first, v[0][k-2].first + v[1][k-1].first);
    }
}

Test 1

Group: 1

Verdict: ACCEPTED

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: ACCEPTED

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: ACCEPTED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: WRONG ANSWER