| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1114741 |
2024-11-19T14:08:27 Z |
Vidicy |
Stove (JOI18_stove) |
C++17 |
|
18 ms |
2896 KB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fr first
#define sec second
signed main() {
ios::sync_with_stdio(NULL);
cin.tie(NULL);
cout.tie(NULL);
int n,k;
cin >> n >> k;
int cnt = n-(n-k);
vector<int> a(n);
for(int i = 0; i < n; i ++)cin >> a[i];
if(n == k) cout << k;
else{
vector<int> b(n-1);
for(int i = 0; i < n-1; i++){
b[i] = abs(a[i] - a[i+1]);
}
sort(b.begin(),b.end());
for(int i = 0; i < n-k; i++){
cnt = cnt + b[i];
}
cout << cnt << endl;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
336 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
1 ms |
336 KB |
Output is correct |
| 4 |
Correct |
1 ms |
336 KB |
Output is correct |
| 5 |
Correct |
1 ms |
336 KB |
Output is correct |
| 6 |
Correct |
1 ms |
336 KB |
Output is correct |
| 7 |
Correct |
1 ms |
508 KB |
Output is correct |
| 8 |
Correct |
1 ms |
336 KB |
Output is correct |
| 9 |
Correct |
1 ms |
592 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
336 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
1 ms |
336 KB |
Output is correct |
| 4 |
Correct |
1 ms |
336 KB |
Output is correct |
| 5 |
Correct |
1 ms |
336 KB |
Output is correct |
| 6 |
Correct |
1 ms |
336 KB |
Output is correct |
| 7 |
Correct |
1 ms |
508 KB |
Output is correct |
| 8 |
Correct |
1 ms |
336 KB |
Output is correct |
| 9 |
Correct |
1 ms |
592 KB |
Output is correct |
| 10 |
Correct |
2 ms |
504 KB |
Output is correct |
| 11 |
Correct |
1 ms |
336 KB |
Output is correct |
| 12 |
Correct |
1 ms |
336 KB |
Output is correct |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
508 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
336 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
1 ms |
336 KB |
Output is correct |
| 4 |
Correct |
1 ms |
336 KB |
Output is correct |
| 5 |
Correct |
1 ms |
336 KB |
Output is correct |
| 6 |
Correct |
1 ms |
336 KB |
Output is correct |
| 7 |
Correct |
1 ms |
508 KB |
Output is correct |
| 8 |
Correct |
1 ms |
336 KB |
Output is correct |
| 9 |
Correct |
1 ms |
592 KB |
Output is correct |
| 10 |
Correct |
2 ms |
504 KB |
Output is correct |
| 11 |
Correct |
1 ms |
336 KB |
Output is correct |
| 12 |
Correct |
1 ms |
336 KB |
Output is correct |
| 13 |
Correct |
1 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
508 KB |
Output is correct |
| 15 |
Correct |
1 ms |
336 KB |
Output is correct |
| 16 |
Correct |
14 ms |
2896 KB |
Output is correct |
| 17 |
Correct |
14 ms |
2896 KB |
Output is correct |
| 18 |
Correct |
14 ms |
2896 KB |
Output is correct |
| 19 |
Correct |
14 ms |
2896 KB |
Output is correct |
| 20 |
Correct |
14 ms |
2896 KB |
Output is correct |
| 21 |
Correct |
18 ms |
2896 KB |
Output is correct |
| 22 |
Correct |
14 ms |
2896 KB |
Output is correct |
| 23 |
Correct |
14 ms |
2896 KB |
Output is correct |
| 24 |
Correct |
15 ms |
2896 KB |
Output is correct |
