oj.uz

Submission #919088

# Submission time Handle Problem Language Result Execution time Memory
919088 2024-01-31T08:30:37 Z imarn Potatoes and fertilizers (LMIO19_bulves) C++14
0 / 100
 1 ms 344 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define vp vector<pii>
using namespace std;
priority_queue<ll>q;
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n;cin>>n;
    ll dp[n+1]={0};
    for(int i=1,a,b;i<=n;i++){
        cin>>a>>b;dp[i]=a-b+dp[i-1];
    }ll res=0;
    for(int i=1;i<n;i++){
        res+=dp[i];
        q.push(dp[i]);
        q.push(dp[i]);
        q.pop();
    }
    while(!q.empty()){
        res-=min(dp[n],q.top());q.pop();
    }cout<<res;
}

Subtask #1
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -