Submission #2216089

---

Source Code Expand

#include <bits/stdc++.h>

#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()

using namespace std;

typedef long long ll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pii;
struct edge{int from, to; ll cost;};

const ll MOD = 1000000007;
const double EPS = 1e-9;

int main(){
    std::ios::sync_with_stdio(0); cin.tie(0);

    int x,y,z;
    cin >> x >> y >> z;
    int n = x+y+z;
    vector<ll> a(n),b(n),c(n);
    rep(n) cin >> a[i] >> b[i] >> c[i];

    vector<Pll> ab(n);
    rep(n){
        ab[i].first = a[i] - b[i];
        ab[i].second = i;
    }
    sort(rall(ab));
    rep(n) cout << ab[i].first << ":" << ab[i].second << " ";
    cout << endl;

    ll ans = 0;
    reppp(k, x, n-y+1){
        ll left = 0, right = 0;

        // 左からもらうコインの最大化 (a575)
        vector<Pll> ac(k);
        rep(k){
            ac[i].first = a[ab[i].second] - c[ab[i].second];
            ac[i].second = ab[i].second;
        }
        sort(rall(ac));
        rep(x) left += a[ac[i].second];
        rep(k-x) left += c[ac[x+i].second];

        // 右からもらうコインの最大化 (475)
        vector<Pll> bc(n-k);
        reppp(i, k, n){
            bc[i-k].first = b[ab[i].second] - c[ab[i].second];
            bc[i-k].second = ab[i].second;
        }
        sort(rall(bc));
        rep(y) right += b[bc[i].second];
        rep(n-k-y) right += c[bc[y+i].second];

        ans = max(ans, left+right);
    }
    cout << ans << endl;
}

Submission Info

Judge Result