제출 #1326536

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1326536		rainerevan_	Art Exhibition (JOI18_art)	C++20	100 / 100	124 ms	12104 KiB

art

#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll MAXN = 1e6 + 5;
const ll LOG = 30;
#define vll vector <ll>
#define pll pair <ll, ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " " << (x) << endl;

ll n, m;
pll a [MAXN];
ll pf [MAXN];

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for(ll i = 1; i <= n; i++){
        cin >> a[i].fi >> a[i].se;
    }
    sort(a+1, a+1+n);
    for(ll i = 1; i <= n; i++){
        pf[i] = pf[i-1] + a[i].se;
    }
    ll cnt = 0;
    ll ans = 0;
    for(ll i = 1; i <= n; i++){
        cnt = max(cnt, a[i].fi - pf[i-1]);
        ans = max(ans, pf[i]-a[i].fi+cnt);
    }
    cout << ans << endl;
}

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