Submission #1115215

#TimeUsernameProblemLanguageResultExecution timeMemory
1115215staszic_ojuzArt Exhibition (JOI18_art)C++17
100 / 100
430 ms14924 KiB
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    vector<pair<long long,long long>> a(n);
    for(int i = 0;i<n;i++)
    {
        cin>>a[i].first;
        cin>>a[i].second;
    }
    sort(a.begin(),a.end());
    long long bans = a[0].second;
    long long cans = a[0].second;
    for(int i = 1 ;i<n;i++)
    {
        cans+=a[i].second;
        cans-=a[i].first-a[i-1].first;
        if(a[i].second > cans)
        {
            cans = a[i].second;
        }
        if(cans > bans)
        {
            bans = cans;
        }


    }
    cout<<bans;

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...