Submission #67004306

---

Source Code Expand

import heapq
T=int(input())
ans_f=[]
for _ in range(T):
    N,W=map(int, input().split())
    digit = 60
    xs = [[] for _ in range(digit)]
    for _ in range(N):
        x,y = map(int, input().split())
        xs[x].append(y)
    for i in range(digit):
        xs[i].sort(reverse=True)
    box=[]
    ans=0
    for i in range(digit):
        for x in xs[i]:
            heapq.heappush(box, -x)
        if (1<<i)&W and len(box) > 0:
            p = heapq.heappop(box)
            ans-=p
        box_d = []
        while len(box) > 0:
            if len(box) >= 2:
                p1 = heapq.heappop(box)
                p2 = heapq.heappop(box)
                heapq.heappush(box_d, p1 + p2)
            else:
                p1 = heapq.heappop(box)
                heapq.heappush(box_d, p1)
        box = box_d
    ans_f.append(ans)
for ans in ans_f:
    print(ans)

        
        



    

Submission Info

Judge Result