Submission #77102

#TimeUsernameProblemLanguageResultExecution timeMemory
77102MohamedAhmed0Art Exhibition (JOI18_art)C++14
50 / 100
1052 ms24880 KiB
#include <bits/stdc++.h>

using namespace std;

long long n ;
vector< pair<long long , long long> >vp ;

int main()
{
    cin>>n ;
    for(long long i = 0 ; i < n ; ++i)
    {
        long long x , y ;
        cin>>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 cout<<ans , 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...