原题传送门

1. 问题描述

2. Solution

1、思路分析
堆或优先队列。
2、代码实现

import heapq
import sys

if sys.platform != "linux":
    sys.stdin = open("input/HJ58.txt")


def solve(n, k, nums):
    nums.sort()
    [print(x, end=" ") for x in nums[:k]]
    print()


def solve2(n, k, nums):
    heapq.heapify(nums)
    [print(heapq.heappop(nums), end=" ") for _ in range(k)]
    print()


while True:
    try:
        n, k = list(map(int, input().strip().split()))
        nums = list(map(int, input().strip().split()))
        solve2(n, k, nums)
    except:
        break

标签：heapq,nums,strip,sys,牛客,HJ58,input,print,机试
来源： https://www.cnblogs.com/junstat/p/16172585.html