제출 #650677

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
650677		Shin	Art Exhibition (JOI18_art)	C++14	100 / 100	211 ms	24760 KiB

art

#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair

using namespace std;
template <class X, class Y> bool minimize(X &a, Y b) {
    if (a > b) return a = b, true;
    return false;
}
template <class X, class Y> bool maximize(X &a, Y b) {
    if (a < b) return a = b, true;
    return false;
}

const int N = 5e5 + 7;
pair<long long, int> a[N];
long long pref[N];

signed main() {
  cin.tie(0)->sync_with_stdio(0);
  int n; cin >> n; 
  for (int i = 1; i <= n; i ++) {
    cin >> a[i].fi >> a[i].se;
  }
  sort(a + 1, a + n + 1);
  long long res = 0, mx = 0;
  for (int i = 1; i <= n; i ++) {
    pref[i] = pref[i - 1] + a[i].se;
    maximize(mx, -pref[i - 1] + a[i].fi);
    maximize(res, pref[i] - a[i].fi + mx);
  }
  cout << res;
  return 0;
}

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