2017年4月3日
UVa - 11997 - K Smallest Sums贪心多路归并
摘要： K Smallest SumsYou're given k arrays, each array has k integers. There are kk ways to pick exactly one element in each array and calculate the sum of ... 阅读全文
posted @ 2017-04-03 17:35 Lawliet__zmz 阅读(191) 评论(0) 推荐(0) 编辑