Submission #213086

#TimeUsernameProblemLanguageResultExecution timeMemory
213086mohamedsobhi777Jakarta Skyscrapers (APIO15_skyscraper)C++14
0 / 100
5 ms512 KiB
#include <bits/stdc++.h>

using namespace std ; 
const int N = 1e5 + 7 ; 

int n ;
vector<pair<int , int > >  v ; 
long long ans ; 
long long suf[N]; 

int main(){
    ios_base::sync_with_stdio(0) ;
    cin.tie(0) ;     
   //freopen("in.in" , "r" , stdin) ; 
    cin>>n ;
    for(int i = 0 ; i < n;i++){
        long long a ,b ; 
        cin>>a>>b ; 
        v.push_back({a , b}) ; 
    }
    sort(v.begin() , v.end()) ;
    suf[n-1] = v[n-1].second ; 
    for(int i = n-2 ; i>=0 ; i--){
        suf[i] = suf[i+1] + v[i].second ; 
    }
    
    for(int i =n-1 ; i>=0 ;i--){
        long long cur = v[i].first + suf[i]; 
        for(int j = i ;j <n;j++){
            ans = max(ans , cur - suf[j+1] - v[j].first ) ;   
        }
    }
    cout<<ans; 
    return 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...
#Verdict Execution timeMemoryGrader output
Fetching results...