Submission #888273

#	Time	Username	Problem	Language	Result	Execution time	Memory
888273		Marco_Escandon	Art Exhibition (JOI18_art)	C++11	100 / 100	132 ms	9044 KiB

art

#include<bits/stdc++.h>
using namespace std;
#define optimizar_io ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(0);
#pragma GCC optimize("Ofast")
typedef long long ll;
int main()
{
    optimizar_io
    ll n;
    cin>>n;
    vector<pair<ll,ll>> cad(n);
    for(int i=0; i<n; i++)
        cin>>cad[i].first>>cad[i].second;
    sort(cad.begin(),cad.end());
    ll bs=cad[0].second;
    ll cont=cad[0].second;
    for(int i=1; i<n; i++)
    {
        cont=max(cont-(cad[i].first-cad[i-1].first),0LL)+cad[i].second;
        bs=max(bs,cont);
    }
    cout<<bs;
    return 0;
}

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