codeground [3] 시험 공부

시험 공부

문제

출처 : codeground.org

입력

출처 : codeground.org

출력

출처 : codeground.org

---

입출력예

입력	출력
1	Case#1
4 2	80
20 50 30 30

---

소스.cppgithub

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

#include <iostream> #include <vector> #include <stdio.h> #include <algorithm> using namespace std; int Answer; int main(int argc, char** argv) { int T, test_case; unsigned int num; unsigned int study; cin >> T; for (test_case = 0; test_case < T; test_case++) { scanf("%d", &num); scanf("%d", &study); vector<unsigned int> v(num); for (unsigned int i = 0; i < num; i++) { scanf("%d", &v[i]); } sort(v.begin(), v.end());//낮은게 먼저있네 이게 내림차순인가 Answer = 0; for (int i = 0; i<study; i++) Answer += v[v.size() - i-1]; cout << "Case #" << test_case + 1 << endl; cout << Answer << endl; } return 0;//Your program should return 0 on normal termination. }

---

Link: Github