Suppose there are n queues of positive numbers. I need to minimum sum of k numbers selected from these queues. Note that these are queues so ordering is important and only first number can be selected from any queue at a time. Once that number is selected and removed from queue we can proceed to the next one in that queue. So sorting is not allowed(order is important).Suppose there are n queues of positive numbers.
阅读背景：
算法:从n个数组(队列)中找到k个数的最小和
来源：互联网
分享到：
