This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// Patryk Niemczyk art.cpp
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0);
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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |