# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
968565 | tset | Art Exhibition (JOI18_art) | C++14 | 147 ms | 23012 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18 +42;
signed main()
{
int N;
scanf("%lld", &N);
vector<pair<int, int>> tab;
for(int iTab = 0; iTab < N; iTab++)
{
int A, B;
scanf("%lld%lld", &A, &B);
tab.push_back({A, B});
}
tab.push_back({-INF, -INF});
sort(tab.begin(), tab.end());
vector<int> cumulS(N+1, 0);
for(int i= 1; i<=N; i++)
{
cumulS[i] = cumulS[i-1] + tab[i].second;
}
vector<int> bonus(N+1);
for(int i=1; i<=N; i++)
{
bonus[i] = max(tab[i].first - cumulS[i-1], bonus[i-1]);
}
int ans = -INF;
for(int iMax=1; iMax<= N; iMax++)
{
ans = max(ans, cumulS[iMax] + bonus[iMax] - tab[iMax].first);
}
printf("%lld\n", ans);
}
Compilation message (stderr)
# | 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... |