Submission #5812818

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define _for(i,j,N) for(int i = (j);i < (N);i++)
#define _rep(i,j,N) for(int i = (j);i <= (N);i++)
#define ALL(x) x.begin(),x.end()
#define pb push_back
#define mk make_pair

typedef long long LL;
typedef pair<int,int> Interval;

template<typename T>
ostream& operator<<(ostream& os,const vector<T>& v) {
    _for(i,0,v.size()) os << v[i] << " ";
    return os;
}

template<typename T>
ostream& operator<<(ostream& os,const set<T>& v){
    for(typename set<T>::iterator it = v.begin();it != v.end();it++)
    os << *it <<" ";
    return os;
}

template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& v){
    os << v.first <<" "<<v.second<<endl;
    return os;
}

const int maxn = 1e5+5;
LL A[maxn];
LL B[maxn];
LL C[maxn];

vector<int> vi;
vector<int> ansA;
vector<int> ansB;
vector<int> ansC;

struct CmpAB{
    bool operator()(const int &a,const int &b){
        return (A[a]-B[a]) > (A[b] - B[b]);
    }
};
struct CmpAC{
    bool operator()(const int &a,const int &b){
        return (A[a]-C[a]) > (A[b] - C[b]);
    }
};

struct CmpBC{
    bool operator()(const int &a,const int &b){
        return (B[a]-C[a]) > (B[b] - C[b]);
    }
};

int X,Y,Z;
LL sum1[maxn];
LL sum2[maxn];

int main()
{
    cin >> X >> Y >> Z;
    int N = X+Y+Z;

    _rep(i,1,N){
        vi.push_back(i);
        scanf("%lld %lld %lld",&A[i],&B[i],&C[i]);
    }


    sort(ALL(vi),CmpAB());

    LL ans = 0;
    priority_queue<int,vector<int>,CmpAC> pq1;
    priority_queue<int,vector<int>,CmpBC> pq2;

    _for(i,0,X){
        pq1.push(vi[i]);
        ans += A[vi[i]];
    }

    sum1[0] = ans;

    _for(i,1,Z+1){
        int now = X - 1 + i;
        int nn = vi[now];
        int ch = pq1.top();
        sum1[i] = sum1[i-1];

        if(A[nn] - C[nn] > A[ch] - C[ch]){
            sum1[i] -= A[ch];
            sum1[i] += (A[nn]+C[ch]);
            pq1.pop();
            pq1.push(nn);
        }else sum1[i] += C[nn];

    }

    reverse(ALL(vi));

    ans = 0;

    _for(i,0,Y){
        pq2.push(vi[i]);
        ans += B[vi[i]];
    }
    sum2[0] = ans;
    //cout << ans << endl;

    _for(i,1,Z+1){
        int now = Y - 1 + i;
        int nn = vi[now];
        int tp = pq2.top();
        sum2[i] = sum2[i-1];

        if((B[nn] - C[nn]) > B[tp] - C[tp]){
            sum2[i] -= B[tp];
            sum2[i] += (B[nn]+C[tp]);
            pq2.pop();
            pq2.push(nn);
        }else sum2[i] += C[nn];
    }

    reverse(sum2,sum2+Z+1);

    ans = 0;
    _rep(i,0,Z){
        //cout << sum1[i] <<" "<<sum2[i]<<endl;
        ans = max(ans,sum1[i]+sum2[i]);
    }
    //cout << vi << endl;

    cout << ans << endl;
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:71:50: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld %lld %lld",&A[i],&B[i],&C[i]);
                                                  ^

Judge Result