Submission #1115610

#	Time	Username	Problem	Language	Result	Execution time	Memory
1115610		staszic_ojuz	Art Exhibition (JOI18_art)	C++17	100 / 100	141 ms	24900 KiB

art

#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long n;
    cin>>n;
    vector<pair<long long, long long>> vect(n);
    for (long long i=0;i<n;i++) cin>>vect[i].first>>vect[i].second;
    sort(vect.begin(), vect.end());
    vector<long long> adds(n);
    adds[n-1]=vect[n-1].second;
    for (long long i=0;i<n-1;i++){
        adds[i]=vect[i].second-vect[i+1].first+vect[i].first;
    }
    long long current=0, best=-1e15-1;
    for (long long i=n-1;i>=0;i--){
        current+=adds[i];
        current=max(current, vect[i].second);
        best=max(best, current);
    }
    cout<<best<<'\n';
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50