# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
875627 | TahirAliyev | Stove (JOI18_stove) | C++17 | 38 ms | 1684 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>
using namespace std;
#define ll long long int
#define pii pair<int, int>
#define oo 1e9
const int MAX = 1e5 + 5;
int n, k;
int arr[MAX];
vector<int> v;
int main(){
cin >> n >> k;
for(int i = 1; i <= n; i++){
cin >> arr[i];
}
for(int i = 2; i <= n; i++){
if(arr[i] - arr[i - 1] - 1 > 0){
v.push_back(arr[i] - arr[i - 1] - 1);
}
}
if(k >= v.size() + 1){
cout << n << '\n';
return 0;
}
sort(v.begin(), v.end());
int ans = n;
for(int i = 0; i < v.size() + 1 - k; i++){
ans += v[i];
}
cout << ans << '\n';
}
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... |