oj.uz

Submission #1049697

# Submission time Handle Problem Language Result Execution time Memory
1049697 2024-08-09T04:18:09 Z vjudge1 Art Exhibition (JOI18_art) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pll pair<ll, ll>
#define fi first
#define se second
#define speed ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main() {
    speed;
    int n;
    cin >> n;
    vector<pll> a(n);
    for(int i = 0; i < n; i++) cin >> a[i].fi >> a[i].se;
    sort(begin(a), end(a));
    ll pref[n+1]{}, ans = LLONG_MIN;
    for(int i = 0; i < n; i++) {
        if(!i) pref[i] = a[i].se;
        else pref[i] = pref[i-1] + a[i].se;
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < i; j++) {
            ans = max(ans, pref[i] - (j ? pref[j-1] : 0ll) - (a[i].fi - a[j].fi));
        }
    }
    cout << ans;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 0 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 0 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 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -