Karuselli

#include <iostream>
#include <set>
#include <algorithm>
using namespace std;
typedef long long ll;
#define F first
#define S second

pair<int,int> t[14][101010];

int main(){
  int n, k; cin >> n >> k;
  for(int i =0; i<n; ++i){
    for(int j=0; j<k; ++j){
      cin >> t[i][j].F;
      t[i][j].S = j;
    }
    sort(t[i], t[i]+k);
    reverse(t[i], t[i]+k);
  }
  if(n == 1) cout << t[0][0].F;
  else if(n == 2){
    int V = 0;
    if(t[0][0].S != t[1][0].S) V = t[0][0].F+t[1][0].F;
    else V = max(t[0][0].F+t[1][1].F, t[0][1].F+ t[1][0].F);
    cout << V;
  }else cout << "QAQ";
  
}

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

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER