181C - Trading Business - CodeForces Solution

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

const int N = 11, M = 101;

int n, m, k, a[N][M], b[N][M], c[N][M];

int main() {
    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) {
        string name;
        cin >> name;
        for (int j = 1; j <= m; j++) {
            cin >> a[i][j] >> b[i][j] >> c[i][j];
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            if (i == j) {
                continue;
            }
            vector<int> vec;
            for (int x = 1; x <= m; x++) {
                for (int y = 1; y <= c[i][x]; y++) {
                    vec.push_back(b[j][x] - a[i][x]);
                }
            }
            sort(vec.begin(), vec.end());
            reverse(vec.begin(), vec.end());
            int sum = 0;
            for (int x = 0; x < min(k, (int)vec.size()); x++) {
                sum += max(vec[x], 0);
            }
            ans = max(ans, sum);
        }
    }
    cout << ans;
    return 0;
}/*1689884908.9791336*/