# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
77103 | MohamedAhmed0 | Art Exhibition (JOI18_art) | C++14 | 1078 ms | 8928 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;
long long n ;
vector< pair<long long , long long> >vp ;
int main()
{
scanf("%lld" , &n);
for(long long i = 0 ; i < n ; ++i)
{
long long x , y ;
scanf("%lld %lld" , &x , &y);
vp.push_back({x , y});
}
sort(vp.begin() , vp.end());
long long ans = 0 ;
for(long long i = 0 ; i < n ; ++i)
{
long long MAX = 0 , MIN = 1e18 , sum = 0 ;
for(long long j = i ; j < n ; ++j)
{
MAX = max(MAX , vp[j].first);
MIN = min(MIN , vp[j].first);
sum += vp[j].second ;
ans = max(ans , sum - (MAX - MIN)) ;
}
}
return printf("%lld" , ans) , 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... |