# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81232 | farukkastamonuda | Stove (JOI18_stove) | C++14 | 30 ms | 10468 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 fi first
#define se second
#define lo long long
#define inf 1000000000
#define md 1000000007
#define li 100005
#define mp make_pair
#define pb push_back
#define pi pair<lo int, int>
using namespace std;
int n, k, T[li], cev;
vector<int> v;
int main(){
scanf("%d %d", &n, &k);
for(int i = 1; i <= n ; i ++){
scanf("%d", &T[i]);
if(i > 1) v.pb(T[i] - T[i - 1] -1);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for(int i = 1; i < k; i ++){
cev += v[i - 1];
}
printf("%d\n", T[n] - T[1] + 1 - cev);
return 0;
}
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... |