답안 #141537

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
141537	2019-08-08T10:35:21 Z	DrumpfTheGodEmperor	Art Exhibition (JOI18_art)	C++14	100 / 100	250 ms	13644 KB

#include <bits/stdc++.h>
#define int long long
#define bp __builtin_popcountll
#define pb push_back
#define in(s) freopen(s, "r", stdin);
#define out(s) freopen(s, "w", stdout);
#define inout(s, end1, end2) freopen((string(s) + "." + end1).c_str(), "r", stdin),\
		freopen((string(s) + "." + end2).c_str(), "w", stdout);
#define fi first
#define se second
#define bw(i, r, l) for (int i = r - 1; i >= l; i--)
#define fw(i, l, r) for (int i = l; i < r; i++)
#define fa(i, x) for (auto i: x)
using namespace std;
const int mod = 1e9 + 7, inf = 1061109567;
const long long infll = 4557430888798830399;
const int N = 5e5 + 5;
struct Painting {
	int size, val;
	bool operator<(const Painting &rhs) {
		return size < rhs.size;
	}
} p[N];
int n;
signed main() {
	#ifdef BLU
	in("blu.inp");
	#endif
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n;
	fw (i, 0, n) cin >> p[i].size >> p[i].val;
	sort(p, p + n);
	fw (i, 1, n) p[i].val += p[i - 1].val;
	int ans = -infll, curMx = -infll;
	fw (i, 0, n) {
		curMx = max(curMx, p[i].size - (i ? p[i - 1].val : 0));
		ans = max(ans, p[i].val - p[i].size + curMx);
	}
	cout << ans;
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	248 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	428 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	428 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	3 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	5 ms	552 KB	Output is correct
28	Correct	5 ms	504 KB	Output is correct
29	Correct	5 ms	632 KB	Output is correct
30	Correct	5 ms	504 KB	Output is correct
31	Correct	5 ms	504 KB	Output is correct
32	Correct	5 ms	632 KB	Output is correct
33	Correct	5 ms	564 KB	Output is correct
34	Correct	5 ms	504 KB	Output is correct
35	Correct	5 ms	632 KB	Output is correct
36	Correct	4 ms	504 KB	Output is correct
37	Correct	4 ms	632 KB	Output is correct
38	Correct	5 ms	632 KB	Output is correct
39	Correct	5 ms	632 KB	Output is correct
40	Correct	5 ms	632 KB	Output is correct
41	Correct	5 ms	508 KB	Output is correct
42	Correct	5 ms	504 KB	Output is correct
43	Correct	4 ms	504 KB	Output is correct
44	Correct	5 ms	632 KB	Output is correct
45	Correct	4 ms	504 KB	Output is correct
46	Correct	30 ms	504 KB	Output is correct
47	Correct	10 ms	564 KB	Output is correct
48	Correct	5 ms	504 KB	Output is correct
49	Correct	5 ms	604 KB	Output is correct
50	Correct	4 ms	504 KB	Output is correct
51	Correct	4 ms	504 KB	Output is correct
52	Correct	246 ms	12864 KB	Output is correct
53	Correct	246 ms	12920 KB	Output is correct
54	Correct	246 ms	12916 KB	Output is correct
55	Correct	243 ms	12920 KB	Output is correct
56	Correct	245 ms	12948 KB	Output is correct
57	Correct	249 ms	13048 KB	Output is correct
58	Correct	244 ms	13020 KB	Output is correct
59	Correct	248 ms	12936 KB	Output is correct
60	Correct	249 ms	13024 KB	Output is correct
61	Correct	244 ms	12928 KB	Output is correct
62	Correct	243 ms	13052 KB	Output is correct
63	Correct	249 ms	13072 KB	Output is correct
64	Correct	243 ms	12152 KB	Output is correct
65	Correct	250 ms	11952 KB	Output is correct
66	Correct	245 ms	12072 KB	Output is correct
67	Correct	245 ms	13644 KB	Output is correct
68	Correct	243 ms	11896 KB	Output is correct

답안 #141537

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
50.0 / 50.0