# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103351 | tincamatei | Stove (JOI18_stove) | C++14 | 38 ms | 2176 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;
const int MAX_N = 100000;
int t[MAX_N];
int dist[MAX_N - 1];
int main() {
#ifdef HOME
FILE *fin = fopen("input.in", "r");
FILE *fout = fopen("output.out", "w");
#else
FILE *fin = stdin;
FILE *fout = stdout;
#endif
int n, k, rez;
fscanf(fin, "%d%d", &n, &k);
for(int i = 0; i < n; ++i)
fscanf(fin, "%d", &t[i]);
rez = 1;
for(int i = 0; i < n - 1; ++i) {
dist[i] = t[i + 1] - t[i] - 1;
rez = rez + t[i + 1] - t[i];
}
sort(dist, dist + n - 1);
for(int i = 0; i < k - 1; ++i)
rez = rez - dist[n - i - 2];
fprintf(fout, "%d", rez);
fclose(fin);
fclose(fout);
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... |