| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 718156 |
2023-04-03T13:18:01 Z |
Yell0 |
Stove (JOI18_stove) |
C++17 |
|
21 ms |
2088 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MN=1e5+2;
int N,K,a[MN],in[MN];
int main() {
ios::sync_with_stdio(0);cin.tie(0);
cin>>N>>K;
for(int i=0;i<N;++i) cin>>a[i];
sort(a,a+N);
for(int i=1;i<N;++i) in[i]=a[i]-a[i-1];
sort(in+1,in+N);
ll ans=N;
for(int i=1;i<=N-K;++i) ans+=in[i]-1;
cout<<ans<<'\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
336 KB |
Output is correct |
| 7 |
Correct |
1 ms |
328 KB |
Output is correct |
| 8 |
Correct |
1 ms |
332 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
336 KB |
Output is correct |
| 7 |
Correct |
1 ms |
328 KB |
Output is correct |
| 8 |
Correct |
1 ms |
332 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
376 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
340 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
336 KB |
Output is correct |
| 7 |
Correct |
1 ms |
328 KB |
Output is correct |
| 8 |
Correct |
1 ms |
332 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
376 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
340 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| 16 |
Correct |
19 ms |
2004 KB |
Output is correct |
| 17 |
Correct |
19 ms |
1988 KB |
Output is correct |
| 18 |
Correct |
20 ms |
2032 KB |
Output is correct |
| 19 |
Correct |
20 ms |
2004 KB |
Output is correct |
| 20 |
Correct |
21 ms |
2088 KB |
Output is correct |
| 21 |
Correct |
18 ms |
1984 KB |
Output is correct |
| 22 |
Correct |
19 ms |
2004 KB |
Output is correct |
| 23 |
Correct |
18 ms |
2048 KB |
Output is correct |
| 24 |
Correct |
18 ms |
2000 KB |
Output is correct |
