Karuselli

#include <iostream>
#include <algorithm>
using namespace std;

int t[14][101010];
int n, k;
long f(int state, int i) {
  if (i == n) return 0;
  long result = 0;
  for (int j = 0; j < n; ++j) {
    if (state & 1<<j) continue;
    result = max(result, t[i][j]+f(state|1<<j, i+1));
  }
  return result;
}
int main() {
  ios_base::sync_with_stdio();
  cin.tie(0);
  cin >> n >> k;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < k; j++) {
      cin >> t[i][j];
    }
    sort(t[i], t[i]+k, greater<int>());
  }
  cout << f(0, 0) << endl;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED