oj.uz

Submission #1076135

# Submission time Handle Problem Language Result Execution time Memory
1076135 2024-08-26T11:21:34 Z lmaobruh Art Exhibition (JOI18_art) C++14
0 / 100
 0 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
const int N = 5e5+5;
int n;
ii a[N];
map<ll, ll> mp;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i].fi >> a[i].se;
        mp[a[i].fi] += a[i].se;
    }
    n = 0;
    for (auto &it : mp) a[++n] = it;
    sort(a+1, a+n+1);
    long long ans = 0, mx = 0;
    for (int i = 1; i <= n; ++i) {
        ans = max(ans, mx - a[i].fi + a[i].se);
        mx = max(mx + a[i].se, a[i].fi + a[i].se);
    }
    cout << ans;
}

Subtask #1
0 / 10.0

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