제출 #126900

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
126900		toonewbie	Art Exhibition (JOI18_art)	C++17	50 / 100	1086 ms	24748 KiB

art

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

#define ll long long
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define all(v) (v).begin(),(v).end()

using namespace std;

const int N = 500005;
const int INF = 1000000000;
const ll INFLL = 1LL * INF * INF;

pair <ll, int> a[N];
ll p[N];
int main() {
    ios_base :: sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].F >> a[i].S;
    }
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; i++) {
        p[i] = p[i - 1] + a[i].S;
    }
    ll res = -INF;
    for (int i = 1; i <= n; i++) {
        for (int j = i; j <= n; j++) {
            res = max(res, (p[j] - p[i - 1]) - (a[j].F - a[i].F));
        }
    }
    cout << res << endl;
    return 0;
}

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