Submission #751093

#TimeUsernameProblemLanguageResultExecution timeMemory
751093vjudge1Art Exhibition (JOI18_art)C++17
0 / 100
1 ms328 KiB
#include<bits/stdc++.h>
#define ll long long
using namespace std;

ll n;
pair<ll, ll> p[500500];
ll pf[500500];

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n;
	for(int i=1; i<=n; i++) cin >> p[i].first >> p[i].second; // berat dan value
	sort(p+1, p+1+n);
	for(int i=1; i<=n; i++) {
		pf[i] = p[i].second + pf[i-1];
	}
	ll ans = -1e9;
	for(int l=1; l<=n; l++) {
		// r s.d. l;
		for(int r=l+1; r<=n; r++){
			ll res = 0;
			res = pf[r] - pf[l-1];
			res = res - (p[r].first - p[l].first);
			ans = max(ans, res);
		}
	}
	cout << ans << endl;;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...