Submission #238596

#	Time	Username	Problem	Language	Result	Execution time	Memory
238596		DodgeBallMan	Potatoes and fertilizers (LMIO19_bulves)	C++14	100 / 100	218 ms	12008 KiB

bulves

#include <bits/stdc++.h>

using namespace std;

const int N = 5e5 + 10;
int n;
long long c[N], ans;
priority_queue<long long> q;

int main()
{
    scanf("%d",&n);
    for( int i = 1 ; i <= n ; i++ ) {
        long long a, b;
        scanf("%lld %lld",&a,&b);
        c[i] = c[i-1] + a - b;
    }
    for( int i = 1 ; i <= n ; i++ ) {
        if( c[i] > c[n] ) ans += c[i] - c[n], c[i] = c[n];
        if( c[i] < 0 ) ans -= c[i], c[i] = 0;
        q.emplace( c[i] );
        if( q.top() != c[i] ) {
            ans += q.top() - c[i];
            q.pop();
            q.emplace( c[i] );
        }
    }
    printf("%lld",ans);
    return 0;
}

Compilation message (stderr)

bulves.cpp: In function 'int main()':
bulves.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
bulves.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld %lld",&a,&b);
         ~~~~~^~~~~~~~~~~~~~~~~~~

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