Submission #200103

#TimeUsernameProblemLanguageResultExecution timeMemory
200103aloo123Art Exhibition (JOI18_art)C++14
50 / 100
1090 ms12024 KiB
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
using namespace std;

const ll N = 5e5+100;
const ll MOD = 1e9+7;
ll pre[N];
int main()
{

    ll n;
    cin>>n;


    pll a[n+1];
    for(int i =1;i<=n;i++)cin>>a[i].f >> a[i].s;

    sort(a+1,a+n+1);
    for(int i =1;i<=n;i++){
        pre[i] = pre[i-1] + a[i].s;
    }
    ll ans = 0;
    for(int i =1;i<=n;i++){
        for(int j =i;j<=n;j++){ 
            ans = max(ans,((pre[j]-pre[i-1]-(a[j].f-a[i].f))));
        }
    }
    cout<<ans<<endl;

    
    return 0;
}

Compilation message (stderr)

art.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
art.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...