제출 #383196

#제출 시각아이디문제언어결과실행 시간메모리
383196ritul_kr_singhArt Exhibition (JOI18_art)C++17
100 / 100
223 ms8556 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << " " <<
#define nl << "\n"

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int n; cin >> n;
	array<int, 2> s[n];
	for(auto &i : s) cin >> i[0] >> i[1];
	sort(s, s+n);

	int pre = 0, currMin = 1e18, res = -1e18;
	for(int i=0; i<n; ++i){
		pre += s[i][1];
		currMin = min(currMin, pre - s[i][0] - s[i][1]);
		res = max(res, pre - s[i][0] - currMin);
	}
	cout << res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...