Submission #422156

#	Time	Username	Problem	Language	Result	Execution time	Memory
422156		JerryLiu06	Potatoes and fertilizers (LMIO19_bulves)	C++17	30 / 100	117 ms	13264 KiB

bulves

#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
const int MOD = 1e9 + 7;
const int MX = 5e5 + 10;
const ll INF = 1e18;

int N, D[MX]; priority_queue<ll> Q; ll ans;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);

    cin >> N; FOR(i, 1, N + 1) {
        int A, B; cin >> A >> B; D[i] = A - B + D[i - 1];
    }
   // FOR(i, 1, N + 1) cout << D[i] << "\n";
  
    FOR(i, 1, N + 1) {
        if (D[i] < 0) { ans -= D[i]; D[i] = 0; }
        
        if (D[i] > D[N]) { ans += D[i] - D[N]; D[i] = D[N]; }
        
        Q.push(D[i]); if (Q.top() > D[i]) {
            ans += Q.top() - D[i]; Q.pop(); Q.push(D[i]);
        }
    }
    cout << ans;
}

• Subtask 1: 0 / 24
• Subtask 2: 0 / 10
• Subtask 3: 20 / 20
• Subtask 4: 10 / 10
• Subtask 5: 0 / 36