답안 #246395

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
246395	2020-07-09T04:56:54 Z	kevlee	Art Exhibition (JOI18_art)	C++17	100 / 100	395 ms	48376 KB

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;
    ans = max(ans, 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

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	6 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	6 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct

Subtask #3

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	6 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	7 ms	768 KB	Output is correct
28	Correct	7 ms	768 KB	Output is correct
29	Correct	7 ms	768 KB	Output is correct
30	Correct	7 ms	768 KB	Output is correct
31	Correct	7 ms	768 KB	Output is correct
32	Correct	9 ms	768 KB	Output is correct
33	Correct	7 ms	896 KB	Output is correct
34	Correct	8 ms	896 KB	Output is correct
35	Correct	9 ms	896 KB	Output is correct
36	Correct	9 ms	896 KB	Output is correct
37	Correct	7 ms	896 KB	Output is correct
38	Correct	8 ms	896 KB	Output is correct
39	Correct	7 ms	768 KB	Output is correct
40	Correct	9 ms	896 KB	Output is correct
41	Correct	8 ms	768 KB	Output is correct
42	Correct	8 ms	896 KB	Output is correct
43	Correct	8 ms	896 KB	Output is correct
44	Correct	10 ms	768 KB	Output is correct
45	Correct	7 ms	768 KB	Output is correct
46	Correct	8 ms	896 KB	Output is correct
47	Correct	7 ms	768 KB	Output is correct
48	Correct	7 ms	768 KB	Output is correct
49	Correct	8 ms	768 KB	Output is correct
50	Correct	7 ms	768 KB	Output is correct
51	Correct	10 ms	768 KB	Output is correct

Subtask #4

50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	6 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	5 ms	384 KB	Output is correct
22	Correct	5 ms	384 KB	Output is correct
23	Correct	5 ms	384 KB	Output is correct
24	Correct	5 ms	384 KB	Output is correct
25	Correct	5 ms	384 KB	Output is correct
26	Correct	5 ms	384 KB	Output is correct
27	Correct	7 ms	768 KB	Output is correct
28	Correct	7 ms	768 KB	Output is correct
29	Correct	7 ms	768 KB	Output is correct
30	Correct	7 ms	768 KB	Output is correct
31	Correct	7 ms	768 KB	Output is correct
32	Correct	9 ms	768 KB	Output is correct
33	Correct	7 ms	896 KB	Output is correct
34	Correct	8 ms	896 KB	Output is correct
35	Correct	9 ms	896 KB	Output is correct
36	Correct	9 ms	896 KB	Output is correct
37	Correct	7 ms	896 KB	Output is correct
38	Correct	8 ms	896 KB	Output is correct
39	Correct	7 ms	768 KB	Output is correct
40	Correct	9 ms	896 KB	Output is correct
41	Correct	8 ms	768 KB	Output is correct
42	Correct	8 ms	896 KB	Output is correct
43	Correct	8 ms	896 KB	Output is correct
44	Correct	10 ms	768 KB	Output is correct
45	Correct	7 ms	768 KB	Output is correct
46	Correct	8 ms	896 KB	Output is correct
47	Correct	7 ms	768 KB	Output is correct
48	Correct	7 ms	768 KB	Output is correct
49	Correct	8 ms	768 KB	Output is correct
50	Correct	7 ms	768 KB	Output is correct
51	Correct	10 ms	768 KB	Output is correct
52	Correct	320 ms	48216 KB	Output is correct
53	Correct	319 ms	48220 KB	Output is correct
54	Correct	308 ms	48248 KB	Output is correct
55	Correct	338 ms	48248 KB	Output is correct
56	Correct	351 ms	48248 KB	Output is correct
57	Correct	356 ms	48124 KB	Output is correct
58	Correct	329 ms	48248 KB	Output is correct
59	Correct	325 ms	48252 KB	Output is correct
60	Correct	321 ms	48120 KB	Output is correct
61	Correct	395 ms	48120 KB	Output is correct
62	Correct	325 ms	48248 KB	Output is correct
63	Correct	309 ms	48248 KB	Output is correct
64	Correct	308 ms	48248 KB	Output is correct
65	Correct	299 ms	48244 KB	Output is correct
66	Correct	294 ms	48248 KB	Output is correct
67	Correct	320 ms	48120 KB	Output is correct
68	Correct	344 ms	48376 KB	Output is correct