Submission #1735282

---

Source Code Expand

#include<bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vector<int> >
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
using ll = long long;
using ld =long double;
#define int ll
#define INF 1e9
#define EPS 0.0000000001
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define all(in) in.begin(), in.end()
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
#define MAX 9999999
using namespace std;
typedef pair<int, int> pii;
typedef pair<int,pii> piii;
signed main(){
    int n; cin>>n;
    vector<int>v(3*n);
    rep(i,3*n)cin>>v[i];
    int ans=-INF*INF;
    priority_queue<int,vector<int>,greater<int>>lque;
    priority_queue<int,vector<int>>sque;
    int ls=0,ss=0;
    pii index=pii(n,2*n-1);
    rep(i,n){
        ls+=v[i];
        ss+=v[i+2*n];
        lque.push(v[i]);
        sque.push(v[i+2*n]);
    }
    cmax(ans,ls-ss);
    for(int i=0;i<n/2;i++){
        lque.push(v[index.first+i]);
        sque.push(v[index.second-i]);
        ls+=v[index.first+i]-lque.top();
        ss+=v[index.second-i]-sque.top();
        lque.pop();
        sque.pop();
        cmax(ans,ls-ss);
    }
    int mid=(3*n-1)/2;
    if(n%2){
        int ltemp=ls+v[mid]-min(v[mid],lque.top());
        int stemp=ss+v[mid]-max(v[mid],sque.top());
        cmax(ans, max(ltemp-ss,ls-stemp));
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result