Submission #671891

#TimeUsernameProblemLanguageResultExecution timeMemory
671891moday_morningK blocks (IZhO14_blocks)C++17
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> #define int long long #define fr first #define sc second #define pb push_back using namespace std; void solve() { int n, k; cin >> n >> k; vector <int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } int sum = 0; sort(a.begin(), a.end()); for (int i = 0; i < k-1; i++) { sum += a[i]; } int mx = 0; for (int i = k-1; i < n; i++) { mx = max(mx, a[i]); } cout << mx + sum << "\n"; } signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; // cin >> t; while (t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...