2014年3月5日
UVa11997K Smallest Sums（优先队列）
摘要： K Smallest SumsYou're given k arrays, each array has k integers. There are kkways to pick exactly one element in each array and calculate the sum of the integers. Your task is to find the k smallest sums among them.InputThere will be several test cases. The first line of each case contains an in 阅读全文
posted @ 2014-03-05 22:15 再见~雨泉 阅读(984) 评论(0) 推荐(0)