Submission #528560

#TimeUsernameProblemLanguageResultExecution timeMemory
528560groshiArt Exhibition (JOI18_art)C++17
100 / 100
217 ms12492 KiB
#include<iostream>
#include<vector>
#include<utility>
#include<algorithm>
using namespace std;
vector<pair<long long,long long> > Q;
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    long long n,x,y;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>x>>y;
        Q.push_back({x,y});
    }
    sort(Q.begin(),Q.end());
    long long suma=0,wynik=0;
    for(int i=0;i<n;i++)
    {
        suma=max(suma+Q[i].second,Q[i].first+Q[i].second);
        wynik=max(wynik,suma-Q[i].first);
    }
    cout<<wynik;
    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...