Karuselli

input/code.cpp: In function 'int main()':
input/code.cpp:39:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 1; i <= h.size(); ++i) {
                                 ^

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

using namespace std;
typedef long long ll;
#define PB push_back

int n, k;
vector<pair<ll, int>> hs[15];
ll miel[15][100005];
set<ll> hnums; 
vector<ll> h; // relevant horses <= 196

ll dp[200][(1<<14)];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> k;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < k; ++j) {
            ll cur;
            cin >> cur;
            hs[i].PB({cur, j});
            miel[i][j] = cur;
        }
        sort(hs[i].begin(), hs[i].end());
        reverse(hs[i].begin(), hs[i].end());
        for (int j = 0; j < n; ++j) {
            hnums.insert(hs[i][j].second);
        }
    }
    for (auto a : hnums) {
        h.PB(a);
    }
    
    for (int i = 1; i <= h.size(); ++i) {
        // cur horse = i-1
        for (int j = 0; j < (1<<n); ++j) {
            dp[i][j] = dp[i-1][j];
            for (int k = 0; k < n; ++k) {
                if ((j&(1<<k)) != 0) {
                    dp[i][j] = max(dp[i][j], dp[i-1][j&(~(1<<k))]+miel[k][h[i-1]]);
                }
            }
        }
    }
    cout << dp[h.size()][(1<<n)-1] << "\n";
    return 0;
}

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

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED