| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 532145 |
2022-03-02T07:35:05 Z |
DM1 |
Stove (JOI18_stove) |
C++17 |
|
55 ms |
2284 KB |
#include <bits/stdc++.h>
#define ll long long int
#define FastCode ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
using namespace std;
int n,k,a[1000005],ans;
vector <int> v;
int main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
cin >> n >> k;
for(int i=1;i<=n;i++) cin >> a[i];
for(int i=1;i<n;i++) v.push_back(a[i+1]-a[i]-1);
sort(v.begin(),v.end());
for(int i=0;i<n-k;i++) ans+=v[i];
cout << n+ans << "\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
300 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
300 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
300 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
300 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
3 ms |
332 KB |
Output is correct |
| 11 |
Correct |
2 ms |
308 KB |
Output is correct |
| 12 |
Correct |
2 ms |
312 KB |
Output is correct |
| 13 |
Correct |
2 ms |
332 KB |
Output is correct |
| 14 |
Correct |
2 ms |
332 KB |
Output is correct |
| 15 |
Correct |
3 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
300 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
300 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
3 ms |
332 KB |
Output is correct |
| 11 |
Correct |
2 ms |
308 KB |
Output is correct |
| 12 |
Correct |
2 ms |
312 KB |
Output is correct |
| 13 |
Correct |
2 ms |
332 KB |
Output is correct |
| 14 |
Correct |
2 ms |
332 KB |
Output is correct |
| 15 |
Correct |
3 ms |
332 KB |
Output is correct |
| 16 |
Correct |
55 ms |
2200 KB |
Output is correct |
| 17 |
Correct |
50 ms |
2240 KB |
Output is correct |
| 18 |
Correct |
48 ms |
2212 KB |
Output is correct |
| 19 |
Correct |
49 ms |
2260 KB |
Output is correct |
| 20 |
Correct |
45 ms |
2240 KB |
Output is correct |
| 21 |
Correct |
53 ms |
2284 KB |
Output is correct |
| 22 |
Correct |
48 ms |
2208 KB |
Output is correct |
| 23 |
Correct |
45 ms |
2240 KB |
Output is correct |
| 24 |
Correct |
49 ms |
2212 KB |
Output is correct |
