Submission #970649

#	Time	Username	Problem	Language	Result	Execution time	Memory
970649		Roumak77	Art Exhibition (JOI18_art)	C++17	0 / 100	1 ms	348 KiB

art

#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("-Ofast")
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <limits>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
using namespace std;

using ll = long long;

/*void solve(){
    ll n;
    cin >> n;
    vector<pair<ll, ll>> list_n(n, pair<ll, ll>{0, 0});
    for(ll i = 0; i < n; i++){
        cin >> list_n[i].first;
        cin >> list_n[i].second;
    }


    sort(list_n.begin(), list_n.end());

    ll curr_max = -1E15 - 5;
    for(ll i = 0; i < n; i++){
        ll start = list_n[i].first;
        ll curr = 0;
        for(ll j = i; j < n; j++){
            curr += list_n[j].second;
            curr_max = max(curr_max, curr - list_n[j].first + start);
        }
    }
    cout << curr_max << endl;
}*/

void solve() {
    ll n;
    cin >> n;

    ll curr_max = 0;

    vector<pair<ll, ll>> list_n(n, pair<ll, ll>{0, 0});
    for (ll i = 0; i < n; i++) {
        cin >> list_n[i].first;
        cin >> list_n[i].second;
        curr_max = max(list_n[i].second, curr_max);
    }



    sort(list_n.begin(), list_n.end());

    ll i = 0;
    ll temp_curr = list_n[i].second;
    while(list_n[i + 1].first - list_n[i].first >= list_n[i].second){
        i++;
        //temp_curr += list_n[i].second;
        if(i == n - 1){
            break;
        }
    }
    ll curr = 0;
    ll start = list_n[i].first;
    for(ll j = i; j < n; j++){
        curr += list_n[j].second;
        curr_max = max(curr_max, curr - list_n[j].first + start);
    }

    cout << curr_max << endl;

}


int main(){

    ios_base::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);

    ll t = 1;

    while(t--){
        solve();
    }
}

Compilation message (stderr)

art.cpp: In function 'void solve()':
art.cpp:60:8: warning: unused variable 'temp_curr' [-Wunused-variable]
   60 |     ll temp_curr = list_n[i].second;
      |        ^~~~~~~~~

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