Submission #1014232

#	Time	Username	Problem	Language	Result	Execution time	Memory
1014232		mar	Art Exhibition (JOI18_art)	C++14	100 / 100	363 ms	25520 KiB

art

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e7;
#define f first
#define s second;

pair<ll,ll>p[maxn];
ll ps[maxn];

int main() {
    int n; cin>>n;
    for(int i =0; i < n; i++) {
        cin>>p[i].f>>p[i].s;
    }
    sort(p,p+n);
    ps[0]=p[0].s;
    for(int i =1; i<=n; i++) {
        ps[i]=ps[i-1]+p[i].s;
    }
    ll maxi=0;
    ll ans =0;
    for(int i=0; i<n; i++){
        maxi = max(maxi, p[i].f-ps[i-1]);
        ans = max(ans, ps[i]-p[i].f + maxi);
    }
    cout<<ans<<endl;
    return 0;
}

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