제출 #976757

#제출 시각아이디문제언어결과실행 시간메모리
976757SeenSiravitArt Exhibition (JOI18_art)C++14
100 / 100
145 ms25016 KiB
#include<bits/stdc++.h>
#define ll long long

using namespace std;

struct PAINT
{
    ll sz;
    ll val;

    bool operator < (const PAINT &d2) const{
        return sz < d2.sz;
    }
};

const int mxN = 5e5 + 5;

int n;
PAINT p[mxN];
ll sum[mxN];

int main(){
    ios::sync_with_stdio(0),cin.tie(0);

    cin>> n;

    for(int i=1;i<=n;i++) cin>> p[i].sz >> p[i].val;

    sort(p+1 , p+1+n);

    for(int i=1;i<=n;i++) sum[i] = p[i].val + sum[i-1];

    ll subtract = LLONG_MAX;
    ll ans = 0;

    for(int i=1;i<=n;i++){
        subtract = min(subtract , sum[i-1] - p[i].sz);

        ans = max(ans , sum[i]-p[i].sz - subtract);
    }

    cout<< ans;

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...