Submission #2094230

---

Source Code Expand

#include<vector>
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<map>
#include<functional>
#include<queue>
#include<stack>
#include<string.h>
#include<list>
#define ll long long int
#define MOD 1000000007LL
using namespace std;
int main() {
    int n;
    ll a[314514]={};
    cin>>n;
    for(int i=0;i<3*n;i++){
        cin>>a[i];
    }
    priority_queue<ll,vector<ll>,greater<ll>> qa;
    priority_queue<ll> qb;
    ll sa=0;
    ll sb[314514]={};
    ll ans=-8023372036854775808;
    for(int i=2*n;i<3*n;i++){
        qb.push(a[i]);
        sb[2*n]+=a[i];
    }
    for(int i=0;i<n-1;i++){
        sa+=a[i];
        qa.push(a[i]);
    }
    for(int i=2*n-1;i>=n-1;i--){
        qb.push(a[i]);
        sb[i]=sb[i+1];
        sb[i]+=a[i];
        if((int)qb.size()>n){
        sb[i]-=qb.top();
        qb.pop();
        }
    }
    for(int i=n;i<2*n;i++){
        qa.push(a[i-1]);
        sa+=a[i-1];
        if((int)qa.size()>n){
        sa-=qa.top();
        qa.pop();
        }
        if(sa-sb[i]>ans){
            ans=sa-sb[i];
        }
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result