Submission #162590

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
162590	2019-11-08T20:52:16 Z	fenech20	Art Exhibition (JOI18_art)	C++14	100 / 100	267 ms	8568 KB

art

/**
 * Martin Leshko ([email protected])
 */

#include <bits/stdc++.h>

using namespace std;

#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define sz(a) (int)a.size()

const int N = 300001;

int main() {
  int n;
  scanf("%d", &n);
  vector< pair<long long, long long> > a(n);
  for (int i = 0; i < n; i++) {
    long long x, y;
    scanf("%lld%lld", &x, &y);
    a[i] = {x, y};
  }
  sort(a.begin(), a.end());
  long long prefix = 0, mn = 0x3f3f3f3f3f3f3f3f, ans = -0x3f3f3f3f3f3f3f3f;
  for (int i = 0; i < n; i++) {
    prefix += a[i].second;
    mn = min(mn, prefix - a[i].second - a[i].first);
    ans = max(ans, prefix - a[i].first - mn);
  }
  printf("%lld\n", ans);
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:16:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &n);
   ~~~~~^~~~~~~~~~
art.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%lld", &x, &y);
     ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	252 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	256 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

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	252 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	256 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	252 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	380 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	2 ms	252 KB	Output is correct

Subtask #3

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	252 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	256 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	252 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	380 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	2 ms	252 KB	Output is correct
27	Correct	4 ms	436 KB	Output is correct
28	Correct	4 ms	376 KB	Output is correct
29	Correct	4 ms	376 KB	Output is correct
30	Correct	4 ms	376 KB	Output is correct
31	Correct	4 ms	376 KB	Output is correct
32	Correct	4 ms	376 KB	Output is correct
33	Correct	4 ms	380 KB	Output is correct
34	Correct	4 ms	376 KB	Output is correct
35	Correct	5 ms	376 KB	Output is correct
36	Correct	4 ms	376 KB	Output is correct
37	Correct	4 ms	376 KB	Output is correct
38	Correct	4 ms	376 KB	Output is correct
39	Correct	4 ms	376 KB	Output is correct
40	Correct	4 ms	504 KB	Output is correct
41	Correct	4 ms	376 KB	Output is correct
42	Correct	4 ms	376 KB	Output is correct
43	Correct	4 ms	376 KB	Output is correct
44	Correct	4 ms	376 KB	Output is correct
45	Correct	4 ms	376 KB	Output is correct
46	Correct	4 ms	376 KB	Output is correct
47	Correct	4 ms	376 KB	Output is correct
48	Correct	4 ms	380 KB	Output is correct
49	Correct	4 ms	376 KB	Output is correct
50	Correct	4 ms	376 KB	Output is correct
51	Correct	4 ms	376 KB	Output is correct

Subtask #4

50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	252 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	256 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	252 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	380 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	256 KB	Output is correct
25	Correct	2 ms	256 KB	Output is correct
26	Correct	2 ms	252 KB	Output is correct
27	Correct	4 ms	436 KB	Output is correct
28	Correct	4 ms	376 KB	Output is correct
29	Correct	4 ms	376 KB	Output is correct
30	Correct	4 ms	376 KB	Output is correct
31	Correct	4 ms	376 KB	Output is correct
32	Correct	4 ms	376 KB	Output is correct
33	Correct	4 ms	380 KB	Output is correct
34	Correct	4 ms	376 KB	Output is correct
35	Correct	5 ms	376 KB	Output is correct
36	Correct	4 ms	376 KB	Output is correct
37	Correct	4 ms	376 KB	Output is correct
38	Correct	4 ms	376 KB	Output is correct
39	Correct	4 ms	376 KB	Output is correct
40	Correct	4 ms	504 KB	Output is correct
41	Correct	4 ms	376 KB	Output is correct
42	Correct	4 ms	376 KB	Output is correct
43	Correct	4 ms	376 KB	Output is correct
44	Correct	4 ms	376 KB	Output is correct
45	Correct	4 ms	376 KB	Output is correct
46	Correct	4 ms	376 KB	Output is correct
47	Correct	4 ms	376 KB	Output is correct
48	Correct	4 ms	380 KB	Output is correct
49	Correct	4 ms	376 KB	Output is correct
50	Correct	4 ms	376 KB	Output is correct
51	Correct	4 ms	376 KB	Output is correct
52	Correct	267 ms	8236 KB	Output is correct
53	Correct	264 ms	8188 KB	Output is correct
54	Correct	266 ms	8540 KB	Output is correct
55	Correct	266 ms	8440 KB	Output is correct
56	Correct	265 ms	8440 KB	Output is correct
57	Correct	264 ms	8440 KB	Output is correct
58	Correct	262 ms	8440 KB	Output is correct
59	Correct	264 ms	8484 KB	Output is correct
60	Correct	264 ms	8440 KB	Output is correct
61	Correct	267 ms	8568 KB	Output is correct
62	Correct	266 ms	8440 KB	Output is correct
63	Correct	267 ms	8440 KB	Output is correct
64	Correct	266 ms	8440 KB	Output is correct
65	Correct	267 ms	8440 KB	Output is correct
66	Correct	265 ms	8440 KB	Output is correct
67	Correct	265 ms	8444 KB	Output is correct
68	Correct	262 ms	8456 KB	Output is correct