oj.uz

Submission #1115347

# Submission time Handle Problem Language Result Execution time Memory
1115347 2024-11-20T11:00:51 Z staszic_ojuz Art Exhibition (JOI18_art) C++17
0 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main()
{
    int n;
    cin >> n;
    vector<pair<ll, int>> sv;
    for(int i = 0; i < n; ++i)
    {
        ll a, b;
        cin >> a >> b;
        sv.push_back({a, b});
    }
    sort(sv.begin(), sv.end());
    ll sp[n+1];
    sp[0] = 0;
    sp[1] = sv[0].second;
    for(int i = 2; i <= n; ++i)
        sp[i] = sp[i-1] + sv[i-1].second - sv[i-1].first + sv[i-2].first;
    ll mi = sp[0];
    ll odp = -1e18+7;
    for(int i = 1; i <= n; ++i)
    {
        odp = max(odp, sp[i] - mi);
        mi = min(mi, sp[i]);
    }
    cout << odp;
}

Subtask #1
0 / 10.0

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