# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
223571 | Ruxandra985 | Art Exhibition (JOI18_art) | C++14 | 300 ms | 20984 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;
pair <long long , long long> v[500010];
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int n , i;
long long curr , sol;
fscanf (fin,"%d",&n);
for (i = 1 ; i <= n ; i++){
fscanf (fin,"%lld%lld",&v[i].first,&v[i].second);
}
sort (v + 1 , v + n + 1);
curr = sol = 0;
for (i = 1 ; i <= n ; i++){
if (curr >= 0)
curr += v[i].first - v[i + 1].first + v[i].second;
else curr = v[i].first - v[i + 1].first + v[i].second;
sol = max(sol , v[i].second);
if (i + 1 <= n)
sol = max(sol , curr + v[i + 1].second);
}
fprintf (fout,"%lld",sol);
return 0;
}
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... |