Submission #1135937

#	Time	Username	Problem	Language	Result	Execution time	Memory
1135937		iancu007	Potatoes and fertilizers (LMIO19_bulves)	C++20	0 / 100	169 ms	6220 KiB

bulves

#include <iostream>
#include <cmath>
int a[500005], b[500005], d[500005];
using namespace std;

long long solve(int n)
{
    for (int i=1; i<=n; i++)
        d[i]=a[i]-b[i];

    long long ans=0;
    for (int i=1; i<=n-1; i++)
        if (d[i])
        {
            ans+=abs(d[i]);
            d[i+1]+=d[i];
            d[i] = 0;
        }
    return ans;
}
int main()
{
    int n;
    cin>>n;
    for (int i=1; i<=n; i++)
        cin>>a[i]>>b[i];
    cout<<solve(n);
    return 0;
}

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