Submission #5907446

---

Source Code Expand

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

typedef long long ll;
typedef pair<int,int> P;

#define p_ary(ary,a,b,i) do { cout << "["; for (int (i) = (a);(i) < (b);++(i)) cout << ary[(i)] << ((b)-1 == (i) ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();;++(it)) {if ((it) == map.end()) {cout << "}\n";break;}else cout << "" << (it)->first << "=>" << (it)->second << ", ";}}while(0)

struct coin {
    int x,y,z;
    bool operator<(const coin& a) const {
        return x-y > a.x-a.y;
    }
};

int main() {
    int x,y,z;
    cin >> x >> y >> z;
    int n = x+y+z;
    vector<coin> a(n);
    priority_queue<int> que1,que2;
    for (int i = 0;i < n;++i) cin >> a[i].x >> a[i].y >> a[i].z;
    sort(a.begin(),a.end());
    ll ans = 0;
    for (int i = 0;i < x;++i) {
        ans += a[i].x;
        que1.push(a[i].z-a[i].x);
    }
    for (int i = x+z;i < n;++i) {
        ans += a[i].y;
        que2.push(a[i].z-a[i].y);
    }
    // cout << ans << endl;
    // for (int i = 0;i < n;++i) cout << a[i].x << " " << a[i].y << " " << a[i].z << endl;
    for (int i = x;i < x+z;++i) {
        ll u = que1.top()+a[i].x,v = que2.top()+a[i].y;
        if (u > a[i].z && u > v) {
            ans += u;
            que1.pop();
            que1.push(a[i].z-a[i].x);
        } else if (v > a[i].z && u <= v) {
            ans += v;
            que2.pop();
            que2.push(a[i].z-a[i].y);
        } else {
            ans += a[i].z;
        }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result