제출 #406577

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
406577		FEDIKUS	Art Exhibition (JOI18_art)	C++17	100 / 100	240 ms	20856 KiB

art

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define xx first
#define yy second
#define srt(a) sort(a.begin(),a.end());
#define srtg(a,int) sort(a.begin(),a.end(),greater<int>())
#define lb(a,x) lower_bound(a.begin(),a.end(),x)
#define up(a,x) upper_bound(a.begin(),a.end(),x)
#define fnd(a,x) find(a.begin(),a.end(),x)
#define vstart auto startt=chrono::system_clock::now()
#define vend auto endd=chrono::system_clock::now()
#define vvreme chrono::duration<double> vremee=endd-startt
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef string str;

const int maxn=5e5+10;
pll niz[maxn];

void solve(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++) cin>>niz[i].xx>>niz[i].yy;
    sort(niz,niz+n);
    ll res=0;
    ll maxi=LLONG_MIN;
    ll pref=0;
    for(int i=0;i<n;i++){
        maxi=max(maxi,-pref+niz[i].xx);
        pref+=niz[i].yy;
        res=max(res,pref+maxi-niz[i].xx);
    }
    cout<<res;
}

int main(){
    ios;
    int t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}

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