제출 #1321794

#제출 시각아이디문제언어결과실행 시간메모리
1321794muhammed_coreArt Exhibition (JOI18_art)C++20
0 / 100
1 ms332 KiB
#include <bits/stdc++.h>
using namespace std;
int main()
{
	long long n;
	cin>>n;
	vector<pair<long long,long long>> vt;
	for(long long i=0; i<n; i++) {
		long long abc,abcd;
		cin>>abc>>abcd;
		vt.push_back({abc,abcd});
	}
	long long best=LLONG_MIN;
	sort(vt.begin(),vt.end());
	for(long long i=0; i<n; i++) {
		long long sum=0;
		sum+=vt[i].second;
		for(long long j=i+1; j<n; j++) {
			sum+=vt[j].second;
			best=max(best,sum-(vt[j].first-vt[i].first));
		}
	}
	cout<<best<<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...