제출 #1091664

#제출 시각아이디문제언어결과실행 시간메모리
1091664alex2407K개의 묶음 (IZhO14_blocks)C++17
0 / 100
1 ms1112 KiB
#include <iostream> #include <algorithm> #include <iomanip> using namespace std; int main() { int a[110000], k, n; double sum = 0; cin >> n >> k; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); for (int i = 0; i < k - 1; i++) { sum += a[i]; } sum += a[n - 1]; cout << fixed << setprecision(0) << sum << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...