oj.uz

Submission #1033823

# Submission time Handle Problem Language Result Execution time Memory
1033823 2024-07-25T06:45:46 Z vjudge1 Art Exhibition (JOI18_art) C++17
0 / 100
 1 ms 348 KB 
#include<bits/stdc++.h>
#define pll pair<long long , long long>

using namespace std;

#define int long long
#define fi first
#define se second

const int inf = 1e18;

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);

    int n; cin>> n;
    vector<pll> a(n+1);
    for(int i = 1 ; i <= n ; i++) cin >> a[i].fi >> a[i].se;

    sort(a.begin()+1 , a.end());

    int res = -inf;
    int pre = -a[1].fi;
    int cur = 0;
    for(int i = 1; i <= n ; i++){
        cur += a[i].se;
        int t = cur - a[i].fi;
        res = max(res , t - pre);
        pre = min(pre , t);
    }
    cout << res << "\n";
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -