Submission #1115373

#	Time	Username	Problem	Language	Result	Execution time	Memory
1115373		staszic_ojuz	Art Exhibition (JOI18_art)	C++17	100 / 100	369 ms	18612 KiB

art

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int64_t n;
    cin >> n;
    vector<pair<int64_t,int64_t>> ob(n);
    for (int i=0; i<n; i++) cin >> ob[i].first >> ob[i].second;
    sort(ob.begin(),ob.end());
    vector<int64_t> sumwar={ob[0].second},najw={ob[0].first};
    for (int i=1; i<n; i++){
        sumwar.push_back(sumwar[i-1]+ob[i].second);
        najw.push_back(max(najw[i-1],ob[i].first-sumwar[i-1]));
    }
    int64_t wyn=-1;
    for (int i=0; i<n; i++) wyn=max(wyn,sumwar[i]+najw[i]-ob[i].first);
    cout << wyn;
    return 0;
}

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