Submission #699190

#TimeUsernameProblemLanguageResultExecution timeMemory
699190TAhmed33Art Exhibition (JOI18_art)C++98
0 / 100
0 ms212 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
bool compare (pair <int, int> a, pair <int, int> b) {
	return (a.first <= b.first);
}
signed main () {
	int n;
	cin >> n;
	pair <int, int> arr[n];
	for (auto &i : arr) cin >> i.first >> i.second;

	sort(arr, arr + n, compare);
	int ans = 0;
	for (int i = 0; i < n; i++) {
		int sum = 0;
		int mx = 0;
		int mn = 1e9;
		for (int j = i; j < n; j++) {
			mx = max(mx, arr[j].first);
			mn = min(mn, arr[j].first);
			sum += arr[j].second;
			ans = max(ans, sum - (mx - mn));
		}
	}
	cout << ans << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...