Submission #1144373

#	Time	Username	Problem	Language	Result	Execution time	Memory
1144373		dobri_oke	Art Exhibition (JOI18_art)	C++20	0 / 100	0 ms	320 KiB

art

//#pragma GCC target ("avx2")   
//#pragma GCC optimize ("Ofast")   
#include <bits/stdc++.h>   
using namespace std;  
#define int long long  
#define F first 
#define S second 
#define pb push_back 
const int N = 1e6, NN=26;
const int mod=1e9+7;
//int gcd(int a, int b) { if (b == 0) return a; else return gcd(b, a % b); }
//int lcm(int a, int b) { return a / gcd(a, b) * b; }
//int binpow(int a,int b){if(!b)return 1; if(b&1)return a*binpow(a,b-1)%mod; int x=binpow(a,b/2); return x*x%mod;}
signed main(){   
    ios_base::sync_with_stdio(0);   
    cin.tie(0);   
    cout.tie(0);
    int n;
    cin >> n;
    pair < int, int > a[n+1];
    for(int i=1;i<=n;i++) cin >> a[i].F >> a[i].S;
    sort(a+1, a+n+1);
    int ans=a[1].S, mn=1, sum=a[1].S;
    for(int i=2;i<=n;i++){
        sum+=a[i].S;
        ans=max(ans, sum-(a[i].F-a[mn].F));
        while(mn<i && (sum-a[mn].S)-(a[i].F-a[mn+1].F)>(sum)-(a[i].F-a[mn].F)){
            ans=max(ans, (sum-a[mn].S)-(a[i].F-a[mn+1].F));
            mn++;
        }
    }
    cout << ans;
}

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