topcoder SRM 624 DIV2 CostOfDancing
2014-06-13 11:05
375 查看
排个序,求前k个元素和即可
int minimum(int K, vector <int> danceCost) { sort(danceCost.begin(),danceCost.end()); return accumulate(danceCost.begin(),danceCost.begin()+K,0); }
相关文章推荐
- Topcoder SRM 626 DIV2 SumOfPower
- TopCoder SRM 667 Div1 Problem 250 - OrderOfOperations (状压dp)
- topcoder SRM 624 DIV2 BuildingHeightsEasy
- TopCoder SRM 360 DIV2 500 分题目, 需要排列组合么?需要强力法么?
- topcoder srm 663 div1 -23
- TopCoder SRM 557 div1
- topcoder srm 450 div1
- TopCoder SRM 604 Div1 第1题
- topcoder SRM 639 div2
- topcoder SRM 513 DIV2
- topcoder srm 335 div1
- topcoder srm 320 div1
- TopCoder——SRM 519 DIV 2
- topcoder srm 500 div1
- 数组上计数问题的动态规划-TopCoder-SRM584-DIV2-1000pt
- topcoder srm 350 div1
- TopCoder 250 points 11-SRM 149 DIV 1 86.62/250 34.65%
- Topcoder SRM 626 DIV2 FixedDiceGameDiv2
- TopCoder SRM 646 Div2 Problem 500 - TheGridDivTwo (BFS + 优先队列)
- topcoder srm 703 div1 -3