제출 #246394

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
246394		kevlee	Art Exhibition (JOI18_art)	C++17	0 / 100	5 ms	384 KiB

art

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mod 1000000007
#define h1 7897897897897897
#define h2 7897466719774591
#define b1 98762051
#define b2 98765431
#define inf 1000000000
#define pi 3.1415926535897932384626
#define LMAX 9223372036854775807
#define ll long long
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pii>
#define SET(a, b) memset(a, b, sizeof(a));
#define all(x) (x).begin(), (x).end()
#define flush fflush(stdout)
#define debug printf("Hello\n")
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
//priority_queue <int, vector <int>, greater <int> > pq;
int n, m, k, x, y, sum, cnt;
ll p[500005];
pll a[500005];
ll ans = -LMAX;
set <ll> s;
int main () {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  FOR(i, 1, n) {
    cin >> a[i].fi >> a[i].se;
  }
  sort(a+1, a+n+1);
  FOR(i, 1, n) {
    p[i] = p[i-1] + a[i].se;
  }
  FOR(i, 1, n) {
    ans = max(ans, p[i] - a[i].fi - *s.begin());
    s.insert(p[i-1] - a[i].fi);
  }
  cout << ans << endl;
  return 0;
}

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