제출 #257611

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
257611	2020-08-04 13:30:57	Nightlight	Potatoes and fertilizers (LMIO19_bulves)	C++14	100 / 100	188 ms	15304 KiB

bulves

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int N;
long long pre[500005];
long long ans;
int main() {
  ios_base::sync_with_stdio(0);
  cin >> N;
  int a, b;
  for(int i = 1; i <= N; i++) {
    cin >> a >> b;
    pre[i] = a - b + pre[i - 1];
  }
  for(int i = 1; i <= N; i++) {
    if(pre[i] < 0) ans -= pre[i], pre[i] = 0;
    else if(pre[i] > pre[N]) ans += pre[i] - pre[N], pre[i] = pre[N];
  }
  priority_queue<long long, vector<long long>> pq;
  pq.emplace(pre[1]);
  for(int i = 2; i <= N; i++) {
    if(pre[i] >= pq.top()) {
      pq.emplace(pre[i]);
    }else {
      ans += (pq.top() - pre[i]);
      pq.emplace(pre[i]);
      pq.emplace(pre[i]);
      pq.pop();
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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