제출 #1119775

#제출 시각아이디문제언어결과실행 시간메모리
1119775staszic_ojuzArt Exhibition (JOI18_art)C++17
100 / 100
487 ms20896 KiB
// Patryk Niemczyk art.cpp
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
	int n;
	cin >> n;

	vector<pair<long long, int>> v(n);
	for (int i = 0; i < n; ++i)
		cin >> v[i].first >> v[i].second;

	sort(v.begin(), v.end());

	long long odp = 0, suma = 0, minimum = 0;

	for (const auto &[wielkosc, wartosc] : v)
	{
		minimum = min(minimum, suma - wielkosc);
		suma += wartosc;
		odp = max(odp, suma - wielkosc - minimum);
	}

	cout << odp << '\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...