Submission #961785

#TimeUsernameProblemLanguageResultExecution timeMemory
961785raspyArt Exhibition (JOI18_art)C++14
50 / 100
1049 ms19324 KiB
#include <iostream>
#include <algorithm>

#define int long long

using namespace std;

struct slika
{
	int vel;
	int vr;
};

slika a[500005];
int kum[500005];

int32_t main()
{
	int n;
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> a[i].vel >> a[i].vr;
	sort(a, a+n, [](slika pr, slika dr){
		return pr.vel < dr.vel;
	});
	for (int i = 1; i <= n; i++)
		kum[i] = kum[i-1]+a[i-1].vr;
	int rez = 0;
	for (int i = 0; i < n; i++)
	{
		int trs = kum[i+1]-a[i].vel;
		for (int j = 0; j <= i; j++)
		{
			rez = max(rez, trs+a[j].vel);
			trs -= a[j].vr;
		}
	}
	cout << rez << "\n";
	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...