Submission #1286304

#TimeUsernameProblemLanguageResultExecution timeMemory
1286304juan_alejandroArt Exhibition (JOI18_art)C++20
50 / 100
1096 ms8260 KiB
#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#pragma GCC optimize("O2")
using namespace std;
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout.precision(0);
    cout<<fixed;
    int n;
    cin>>n;
    vector<pair<int,int>> x(n);
    for (int i = 0; i < n; i++)
    {
        cin>>x[i].first>>x[i].second;
    }
    sort(x.begin(),x.end());
    int res=0;
    for (int i = 0; i < n; i++)
    {
        int s1=0,s2=x[i].first,s3=0;
        for (int j = i; j >= 0; j--)
        {
            s1+=x[j].second;
            s3=x[j].first;
            res=max(res,s1-(s2-s3));
        }
        
    }
    cout<<res<<endl;
    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...