Submission #162585

# Submission time Handle Problem Language Result Execution time Memory
162585 2019-11-08T20:28:52 Z fenech20 Stove (JOI18_stove) C++14
100 / 100
85 ms 2392 KB
```/**
* Martin Leshko ([email protected])
*/

#include <bits/stdc++.h>

using namespace std;

#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define sz(a) (int)a.size()

const int N = 300001;

int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> sums;
for (int i = 1; i < n; i++)
if (a[i] - a[i - 1] > 1)
sums.push_back(a[i] - a[i - 1] - 1);
sort(sums.rbegin(), sums.rend());
int ans = a[sz(a) - 1] - a[0] + 1;
for (int i = 0; i < min(sz(sums), k - 1); i++)
ans -= sums[i];
cout << ans << endl;

}
```

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 9 ms 376 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 4 ms 376 KB Output is correct
11 Correct 9 ms 376 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 4 ms 376 KB Output is correct
16 Correct 85 ms 2340 KB Output is correct
17 Correct 85 ms 2276 KB Output is correct
18 Correct 84 ms 2276 KB Output is correct
19 Correct 84 ms 2292 KB Output is correct
20 Correct 83 ms 2292 KB Output is correct
21 Correct 83 ms 2288 KB Output is correct
22 Correct 85 ms 2392 KB Output is correct
23 Correct 84 ms 2264 KB Output is correct
24 Correct 84 ms 2292 KB Output is correct