제출 #1104792

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1104792		anmattroi	Art Exhibition (JOI18_art)	C++14	100 / 100	156 ms	24784 KiB

art

#include <bits/stdc++.h>

#define maxn 500005
#define fi first
#define se second

using namespace std;

int n;
pair<int64_t, int> a[maxn];
int64_t s[maxn];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i].fi >> a[i].se;
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; i++) s[i] = s[i-1] + a[i].se;
    int64_t minn = 0;
    int64_t maxx = LLONG_MIN;
    for (int i = 1; i <= n; i++) {
        minn = min(minn, s[i-1] - a[i].fi);
        maxx = max(maxx, s[i] - minn - a[i].fi);
    }
    cout << maxx;
}

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