oj.uz

Submission #1071351

# Submission time Handle Problem Language Result Execution time Memory
1071351 2024-08-23T06:51:05 Z vjudge1 Art Exhibition (JOI18_art) C++17
0 / 100
 1 ms 2396 KB 
#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
using namespace std;

const int N = 5e5 + 11;
pair<int, int> a[N];
int pref[N];
int cost(int i, int j) {
    int sum = pref[j] - pref[i - 1];
    int mx = a[j].fi, mn = a[i].fi;
    return sum - (mx - mn);
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int n;
    cin >> n;
    
    for(int i = 1; i <= n; i++){
        cin>>a[i].fi>>a[i].se;
    }
    sort(a + 1, a + 1 + n);
    for(int i = 1; i <= n; i++){
        pref[i] = pref[i - 1] + a[i].se;
    }
    //i-th, pref[i] - a[i].fi
    //j-th -pref[j - 1] + a[j].fi
    set<int> st;
    st.insert(0);
    int ans = 0;
    for(int i = 1; i <= n; i++) {
        int value = *st.rbegin();
        ans = max(ans, (pref[i] - a[i].fi) + value);
        st.insert((-pref[i - 1] + a[i].fi));
    }
    cout << ans << '\n';
}

Subtask #1
0 / 10.0

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