Submission #2096230

---

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() {
    ll n;
    ll a[314514]={};
    cin>>n;
    for(int i=1;i<=3*n;i++){
        cin>>a[i];
    }
    priority_queue<ll,vector<ll>,greater<ll>> qa;
    priority_queue<ll> qb;
    ll sa[314514]={};
    ll sb[314514]={};
    ll ans=-8023372036854775808;
    for(int i=2*n+1;i<=3*n;i++){
        qb.push(a[i]);
        sb[2*n+1]+=a[i];
    }
    for(int i=1;i<=n;i++){
        sa[n]+=a[i];
        qa.push(a[i]);
    }
    for(int i=2*n;i>=n;i--){
        qb.push(a[i]);
        sb[i]=sb[i+1];
        sb[i]+=a[i];
        if(qb.size()>n){
        sb[i]-=qb.top();
        qb.pop();
        }
    }
    for(int i=n+1;i<=2*n;i++){
        qa.push(a[i]);
        sa[i]=sa[i-1];
        sa[i]+=a[i];
        if(qa.size()>n){
        sa[i]-=qa.top();
        qb.pop();
        }
    }
    for(int i=n;i<2*n;i++){
        ans=max(ans,sa[i]-sb[i+1]);
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result