# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164675 | Faisal_Saqib | Potatoes and fertilizers (LMIO19_bulves) | C++20 | 82 ms | 22220 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll N=5e5+10;
ll f[N],p[N];
void solve()
{
ll n;
cin>>n;
for(int i=1;i<=n;i++)
{
// ferti potato
cin>>f[i]>>p[i];
ll mn=min(f[i],p[i]);
p[i]-=mn;
f[i]-=mn;
}
// greedy
queue<vector<int>> q;
ll ans=0;
for(int i=1;i<=n;i++)
{
while(q.size())
{
auto it=q.front();
if(it[2]==0)break;
q.pop();
if(it[0]<=p[i])
{
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |