Submission #476573

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
476573	2021-09-27 16:48:59	idiot123	Potatoes and fertilizers (LMIO19_bulves)	C++14	30 / 100	1092 ms	27580 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 main(){
  int N; cin>>N;
  vector<long long> t(N);
  for(int i = 0; i < N; i++){
    int a, b; cin>>a>>b;
    t[i] = a - b;
  }
  priority_queue<long long, vector<long long>, greater<long long>> q;
  for(int i = 0; i < 2*N; i++)q.push(0);
  long long shift = 0;
  long long val = 0;
  for(int i = 1; i <= N; i++){
    //wywalamy pierwszy punkt
    q.pop();
    //przesuwamy
    shift += t[i-1];
    //pobieramy pozycje pierwszego punktu
    long long x = q.top() + shift;
    if(x <= 0){
      val += abs(x);
      q.push(-shift); q.push(-shift);
    }else{
      q.push(-shift); q.push(-shift);
    }
  }
  long long x = q.top() + shift;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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