提出 #73777614

---

ソースコード 拡げる

def main():
    H,W,N = map(int,input().split())
    choco_w = []
    choco_h = []
    for _ in range(N):
        h,w = map(int,input().split())
        choco_w.append(w)
        choco_h.append(h)
    
    ord_h = [i for i in range(N)]
    ord_h.sort(key = lambda x:-choco_h[x])
    ord_w = [i for i in range(N)]
    ord_w.sort(key = lambda x:-choco_w[x])
    ans = [0 for _ in range(N)]
    is_used = [False for _ in range(N)]
    remain = N
    hp = 0
    wp = 0
    while remain > 0:
        while hp < N and is_used[ord_h[hp]]:hp += 1
        while wp < N and is_used[ord_w[wp]]:wp += 1
        i = ord_h[hp] if hp < N and choco_h[ord_h[hp]] == H else ord_w[wp]

        ans_x = H - choco_h[i] + 1
        ans_y = W - choco_w[i] + 1
        is_used[i] = True

        if choco_h[i] == H:
            W -= choco_w[i]
        else:
            H -= choco_h[i]
        ans[i] = (ans_x,ans_y)
        remain -= 1
    
    for line in ans:
        print(*line)

main()
        

提出情報

ジャッジ結果