Cod sursa(job #2735773)

Utilizator HadircaDionisieHadirca Dionisie HadircaDionisie Data 2 aprilie 2021 19:55:31
Problema Heapuri Scor 0
Compilator py Status done
Runda Arhiva educationala Marime 0.62 kb
import queue

ls = []
with open('proc2.in') as f:
    n, m = [int(i) for i in f.readline().split()]
    for i in range(m):
        x, y = (int(i) for i in f.readline().split())
        ls.append((x, x + y))


coada = queue.PriorityQueue()

max = 0

with open('proc2.out','w') as g:
    coada.put(ls[0])
    g.write('1\n')
    for k in range(1, m):
        if ls[k][0] < coada.queue[0][1]:
            coada.put(ls[k])
            g.write(str(coada.qsize())+'\n')
        else:
            coada.get()
            g.write(str(coada.qsize())+'\n')
        if max<coada.qsize():
            max = coada.qsize()