# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
422816 | KienTranluvChaeng | Stove (JOI18_stove) | C++17 | 27 ms | 2976 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int O = 1e6 + 1;
int a[O];
main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n, k; cin >> n >> k;
vector <int> b;
for (int i = 1; i <= n; ++ i){
cin >> a[i];
if (i > 1) b.push_back(a[i] - a[i - 1] - 1);
}
int ans = n;
sort(b.begin(), b.end());
for (int i = 0; i < n - k; ++ i) ans += b[i];
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |