Submission #67309235

---

Source Code Expand

#include<iostream>
#include<deque>
using namespace std;
#define int long long

int t;

struct node
{
    int x,num;
};
deque<node> q;

signed main()
{
    cin >> t;
    while(t--)
    {
        int opt, x, c, k;
        cin >> opt;
        if(opt == 1)
        {
            cin >> c >> x;
            q.push_back({x,c});
        }
        if(opt == 2)
        {
            cin >> k; int ans = 0;
            while(k > 0)
            {
                int x = q.front().x;
                int num = q.front().num;
                if(num <= k) q.pop_front(), ans += x * num, k -= num;
                else q.pop_front(), ans += x * k, q.push_front({x,num-k}), k = 0;
            }
            cout << ans << endl;
        }
    }
    return 0;
}

Submission Info

Judge Result