Submission #299410

#	Time	Username	Problem	Language	Result	Execution time	Memory
299410		Bruteforceman	Potatoes and fertilizers (LMIO19_bulves)	C++11	100 / 100	703 ms	15336 KiB

bulves

#include <bits/stdc++.h>
using namespace std;


int main() {
  int n;
  cin >> n;
  vector <long long> pre (n + 1);
  for(int i = 1; i <= n; i++) {
    int a, b;
    cin >> a >> b;
    pre[i] = pre[i - 1] + a - b;
  } 
  priority_queue <long long> Q;
  long long base = 0;
  for(int i = 1; i <= n; i++) {
    if(pre[i] < 0) {
      base += -pre[i];
      pre[i] = 0;
    }
    if(pre[i] > pre[n]) {
      base += pre[i] - pre[n];
      pre[i] = pre[n];
    }
    Q.push(pre[i]);
    Q.push(pre[i]);
    if(pre[i] < Q.top()) {
      base += Q.top() - pre[i];
    }
    Q.pop();
  }
  cout << base << endl;
  return 0;
}

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