지연 처리 후 남은 작업

#include <iostream>
#include <vector>
#include <queue>
using namespace std;

void cancel(queue<int>& waiting, int threshold) {
    int count = (int)waiting.size();
    for (int i = 0; i < count; ++i) {
        int value = waiting.front();
        waiting.pop();
        if (/*@blank1@*/) waiting.push(value);
    }
}
int process(queue<int>& waiting, int count) {
    int sum = 0;
    while (/*@blank2@*/) {
        sum += waiting.front();
        waiting.pop();
        --count;
    }
    return sum;
}
vector<int> solution(vector<vector<int>> commands) {
    queue<int> waiting;
    int total = 0;
    for (vector<int> command : commands) {
        if (command[0] == 0) waiting.push(command[1]);
        else if (command[0] == 1) total += process(waiting, command[1]);
        else cancel(waiting, command[1]);
    }
    return {total, (int)waiting.size()};
}
int main() {
    int n;
    cin >> n;
    vector<vector<int>> commands(n, vector<int>(2));
    for (int i = 0; i < n; ++i) cin >> commands[i][0] >> commands[i][1];
    vector<int> answer = solution(commands);
    cout << answer[0] << ' ' << answer[1] << '\n';
}