Submission #1159670

#TimeUsernameProblemLanguageResultExecution timeMemory
1159670eldorbek_008Art Exhibition (JOI18_art)C++17
50 / 100
1094 ms12112 KiB
#include <bits/stdc++.h>
using namespace std;

#define int int64_t

int32_t main() {
	ios :: sync_with_stdio(false);
	cin.tie(nullptr);

	int n;
	cin >> n;
	vector<array<int, 2>> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i][0] >> a[i][1];
	}
	sort(a.begin(), a.end());
	vector<int> p(n);
	for (int i = 0; i < n; i++) {
		p[i] = (i == 0 ? 0 : p[i - 1]) + a[i][1];
	}
	int mx = 0;
	for (int i = 0; i < n; i++) {
		for (int j = i; j < n; j++) {
			int cur = p[j] - (i == 0 ? 0 : p[i - 1]);
			cur -= a[j][0] - a[i][0];
			mx = max(mx, cur);
		}
	}
	cout << mx;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...