제출 #1109186

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1109186		giaminh2211	Art Exhibition (JOI18_art)	C++14	100 / 100	189 ms	12108 KiB

art

#include<bits/stdc++.h>
#define fn(n) for(int i=1; i<=n; i++)
#define f1(n) for(int i=n; i>=1; i--)
#define no cout << "NO";
#define yes cout << "YES";
#define el cout << '\n';
#define a first
#define b second

using namespace std;
using ll=long long;

int n;
pair<ll, ll> a[500002];
ll f[500002];
ll res=-1e18;
ll cur=-1e18;

void nhap(){
    cin >> n;
    for(int i=1; i<=n; i++){
        cin >> a[i].a >> a[i].b;
    }
    sort(a+1, a+n+1);
    for(int i=1; i<=n; i++){
        f[i]=f[i-1]+a[i].b;
    }
}

void solve(){
    for(int i=n; i>=1; i--){
        cur=max(cur, f[i]-a[i].a);
        res=max(res, cur+a[i].a-f[i-1]);
    }
    cout << res;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    nhap();
    solve();
}

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