# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
753460 | IvanJ | Stove (JOI18_stove) | C++17 | 32 ms | 2256 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 x first
#define y second
#define pb push_back
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 1e5 + 5;
int n, k;
int t[maxn];
int main() {
scanf("%d%d", &n, &k);
for(int i = 0;i < n;i++)
scanf("%d", t + i);
sort(t, t + n);
int T = t[n - 1] - t[0] + 1;
vector<int> v;
for(int i = 1;i < n;i++)
v.pb(t[i] - t[i - 1] - 1);
sort(all(v));
reverse(all(v));
for(int i = 0;i < k - 1;i++)
T -= v[i];
printf("%d\n", T);
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... |