Submission #1119827

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1119827	2024-11-27T13:40:17 Z	staszic_ojuz	Art Exhibition (JOI18_art)	C++17	100 / 100	154 ms	8440 KB

// Patryk Niemczyk art.cpp
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
	ios_base::sync_with_stdio(0), cin.tie(0);

	int n;
	cin >> n;

	vector<pair<long long, int>> v(n);
	for (int i = 0; i < n; ++i)
		cin >> v[i].first >> v[i].second;

	sort(v.begin(), v.end());

	long long odp = 0, suma = 0, minimum = 0;

	for (const auto &[wielkosc, wartosc] : v)
	{
		minimum = min(minimum, suma - wielkosc);
		suma += wartosc;
		odp = max(odp, suma - wielkosc - minimum);
	}

	cout << odp << '\n';
	return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	508 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	508 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	2 ms	336 KB	Output is correct
28	Correct	3 ms	336 KB	Output is correct
29	Correct	2 ms	336 KB	Output is correct
30	Correct	2 ms	336 KB	Output is correct
31	Correct	2 ms	336 KB	Output is correct
32	Correct	3 ms	336 KB	Output is correct
33	Correct	2 ms	336 KB	Output is correct
34	Correct	2 ms	336 KB	Output is correct
35	Correct	2 ms	336 KB	Output is correct
36	Correct	2 ms	336 KB	Output is correct
37	Correct	3 ms	336 KB	Output is correct
38	Correct	2 ms	336 KB	Output is correct
39	Correct	3 ms	336 KB	Output is correct
40	Correct	2 ms	336 KB	Output is correct
41	Correct	2 ms	336 KB	Output is correct
42	Correct	3 ms	336 KB	Output is correct
43	Correct	2 ms	336 KB	Output is correct
44	Correct	3 ms	512 KB	Output is correct
45	Correct	2 ms	336 KB	Output is correct
46	Correct	2 ms	336 KB	Output is correct
47	Correct	3 ms	336 KB	Output is correct
48	Correct	2 ms	336 KB	Output is correct
49	Correct	2 ms	336 KB	Output is correct
50	Correct	2 ms	504 KB	Output is correct
51	Correct	2 ms	336 KB	Output is correct

Subtask #4
50.0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	508 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	1 ms	336 KB	Output is correct
17	Correct	1 ms	336 KB	Output is correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Correct	1 ms	336 KB	Output is correct
21	Correct	1 ms	336 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	336 KB	Output is correct
24	Correct	1 ms	336 KB	Output is correct
25	Correct	1 ms	336 KB	Output is correct
26	Correct	1 ms	336 KB	Output is correct
27	Correct	2 ms	336 KB	Output is correct
28	Correct	3 ms	336 KB	Output is correct
29	Correct	2 ms	336 KB	Output is correct
30	Correct	2 ms	336 KB	Output is correct
31	Correct	2 ms	336 KB	Output is correct
32	Correct	3 ms	336 KB	Output is correct
33	Correct	2 ms	336 KB	Output is correct
34	Correct	2 ms	336 KB	Output is correct
35	Correct	2 ms	336 KB	Output is correct
36	Correct	2 ms	336 KB	Output is correct
37	Correct	3 ms	336 KB	Output is correct
38	Correct	2 ms	336 KB	Output is correct
39	Correct	3 ms	336 KB	Output is correct
40	Correct	2 ms	336 KB	Output is correct
41	Correct	2 ms	336 KB	Output is correct
42	Correct	3 ms	336 KB	Output is correct
43	Correct	2 ms	336 KB	Output is correct
44	Correct	3 ms	512 KB	Output is correct
45	Correct	2 ms	336 KB	Output is correct
46	Correct	2 ms	336 KB	Output is correct
47	Correct	3 ms	336 KB	Output is correct
48	Correct	2 ms	336 KB	Output is correct
49	Correct	2 ms	336 KB	Output is correct
50	Correct	2 ms	504 KB	Output is correct
51	Correct	2 ms	336 KB	Output is correct
52	Correct	115 ms	8272 KB	Output is correct
53	Correct	154 ms	8272 KB	Output is correct
54	Correct	148 ms	8272 KB	Output is correct
55	Correct	125 ms	8272 KB	Output is correct
56	Correct	139 ms	8272 KB	Output is correct
57	Correct	154 ms	8272 KB	Output is correct
58	Correct	145 ms	8272 KB	Output is correct
59	Correct	126 ms	8272 KB	Output is correct
60	Correct	122 ms	8272 KB	Output is correct
61	Correct	130 ms	8272 KB	Output is correct
62	Correct	121 ms	8272 KB	Output is correct
63	Correct	121 ms	8272 KB	Output is correct
64	Correct	124 ms	8272 KB	Output is correct
65	Correct	139 ms	8272 KB	Output is correct
66	Correct	124 ms	8272 KB	Output is correct
67	Correct	122 ms	8272 KB	Output is correct
68	Correct	130 ms	8440 KB	Output is correct

Submission #1119827

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