Submission #1273696

#	Time	Username	Problem	Language	Result	Execution time	Memory
1273696		quanduongxuan12	Art Exhibition (JOI18_art)	C++20	100 / 100	139 ms	16332 KiB

art

#include <bits/stdc++.h>
using namespace std;
#define name "art"
#define MAXN 500005
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<ll, ll>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
    u+=v;
    if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
    u-=v;
    if (u<0) u+=MOD;
}
void minimize(ll &u, ll v){
    u=min(u,v);
}
void maximize(ll &u, ll v){
    u=max(u,v);
}
long long Rand(long long l, long long r){
    ll tmp=0;
    FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
    return l+tmp%(r-l+1);
}
int n;
ii a[MAXN];
ll pre[MAXN];
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin>>n;
    FOR(i,1,n) cin>>a[i].fs>>a[i].sc;
    sort(a+1,a+n+1);
    FOR(i,1,n) pre[i]=pre[i-1]+a[i].sc;
    ll res=0;
    priority_queue<ll> pq;
    FOR(i,1,n){
        pq.push(-pre[i-1]+a[i].fs);
        maximize(res,pq.top()+pre[i]-a[i].fs);
    }
    cout<<res;
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50