medium40 XP

At the municipal recycling station, citizens drop off recyclable bins that need to be processed by an automated sorting machine. The sorting machine operates as a single processing queue. The station processes bins in the exact order they arrive (First-In, First-Out). Each arriving bin has an assigned weight and a designated processing time required to crush it. The machine can only process one bin at a time. However, the machine has a daily safety threshold: it can only handle a continuous sequence of bins whose total weight does not exceed a maximum limit. Whenever the cumulative weight of the bins currently waiting in the processing queue exceeds the weight limit, the machine immediately triggers a batch clearance: it takes the front bin out of the queue, processes it completely (adding its processing time to the total time), and removes it. It repeats this removal of the front bin one by one until the total weight of the remaining bins in the queue drops back down to or below the weight limit. Your task is to simulate this process for a given stream of arriving bins and a weight limit. For each bin that is processed and removed from the queue, record its processing time. Output the sequence of processing times in the order that the bins finish processing, followed by the total cumulative processing time of all processed bins. **Input format** The first line contains two integers: `n` (the number of arriving bins) and `limit` (the maximum allowed total weight in the queue before a clearance is triggered). Each of the next `n` lines describes an arriving bin with two space-separated integers: `weight` and `processing_time`. Bins arrive in the order they are listed. **Output format** Print each processing time of a processed bin on its own line, in the order they were processed. On the final line, print the total sum of all processing times.

Example

Input: 4 15
10 5
8 7
3 4
2 6Expected: 5
5

Example

Input: 3 10
4 2
5 3
2 4Expected: 2
2

Problem

Recycling Station Batch Queue

Run locally without logging in. Submit when you are ready.

import sys
from collections import deque
def solve():
    # Read all inputs from standard input
    input_data = sys.stdin.read().split()
    if not input_data:
        return
    n = int(input_data[0])
    limit = int(input_data[1])
    
    # Implement the recycling station queue simulation here
    
    pass
if __name__ == '__main__':
    solve()

Output

No output yet

Run your code to see the result here.