# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931896 | lovrot | Stove (JOI18_stove) | C++17 | 17 ms | 1788 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 <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <iostream>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <random>
#include <chrono>
#define X first
#define Y second
#define PB push_back
#define EB emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MOD = 1e9 + 7; // 998 244 353;
const int N = 1e5 + 10;
int n, k, A[N];
int main() {
scanf("%d%d", &n, &k);
int lst = 0, ans = 0;
for(int i = 0; i < n; ++i) {
int x;
scanf("%d", &x);
A[i] = x - lst - 1;
if(!i) ans -= x;
if(i == n - 1) ans += x + 1;
lst = x;
}
sort(A + 1, A + n, [](int a, int b) { return a > b; });
for(int i = 1; i < k; ++i) ans -= A[i];
printf("%d\n", ans);
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... |