Submission #42267

#TimeUsernameProblemLanguageResultExecution timeMemory
42267RezwanArefin01Art Exhibition (JOI18_art)C++14
50 / 100
1066 ms8428 KiB
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll, ll> ii; 

int main(int argc, char const *argv[]) {
#ifdef LOCAL_TESTING
	freopen("in", "r", stdin);
#endif
	int n; cin >> n; 
	vector<ii> p(n);
	for(int i = 0; i < n; i++) {
		cin >> p[i].first >> p[i].second;
	}
	sort(p.begin(), p.end());

	for(int i = 1; i < n; i++) 
		p[i].second += p[i - 1].second;

	ll Max = 0;
	for(int i = 0; i < n; i++) {
		for(int j = i; j < n; j++) {
			ll S = p[j].second ;
			if(i) S -= p[i - 1].second;
			S -= p[j].first - p[i].first; 
			Max = max(Max, S);
		}
	} cout << Max << 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...