제출 #985811

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
985811		mariaclara	Art Exhibition (JOI18_art)	C++17	100 / 100	144 ms	20820 KiB

art

#include<bits/stdc++.h>
#pragma GCC optimize ("O3")

using namespace std;

typedef long long ll;
typedef tuple<int,int,int> trio;
typedef pair<ll,ll> pii;
const int MAXN = 2e5+10;
const int MOD = 1e9+7;
const ll LINF = 1e18;
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second

int n;
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;

    vector<pii> v(n);

    for(int i = 0; i < n; i++)
        cin >> v[i].fr >> v[i].sc;

    sort(all(v));

    ll sum = 0, at = -LINF, ans = 0;
    for(int i = 0; i < n; i++) {
        at = max(at, v[i].fr - sum);
        sum += v[i].sc;
        ans = max(ans, - v[i].fr + sum + at);
    }

    cout << ans << "\n";
}

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