# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
851062 |
2023-09-18T12:11:36 Z |
AliHasanli |
Stove (JOI18_stove) |
C++17 |
|
36 ms |
2380 KB |
#include <bits/stdc++.h>
using namespace std;
int n,k,a[100005],b[100005],ans;
int main()
{
cin>>n>>k>>a[0];
for(int i=1;i<n;i++)
{
cin>>a[i];
b[i]=a[i]-a[i-1];
}
sort(b+1,b+n);
for(int i=1;i<=n-k;i++)
ans+=b[i]-1;
cout<<ans+n;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
600 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
600 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
460 KB |
Output is correct |
13 |
Correct |
2 ms |
348 KB |
Output is correct |
14 |
Correct |
2 ms |
348 KB |
Output is correct |
15 |
Correct |
2 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
600 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
1 ms |
460 KB |
Output is correct |
13 |
Correct |
2 ms |
348 KB |
Output is correct |
14 |
Correct |
2 ms |
348 KB |
Output is correct |
15 |
Correct |
2 ms |
348 KB |
Output is correct |
16 |
Correct |
35 ms |
2128 KB |
Output is correct |
17 |
Correct |
36 ms |
2156 KB |
Output is correct |
18 |
Correct |
32 ms |
2136 KB |
Output is correct |
19 |
Correct |
34 ms |
2132 KB |
Output is correct |
20 |
Correct |
34 ms |
2128 KB |
Output is correct |
21 |
Correct |
35 ms |
2380 KB |
Output is correct |
22 |
Correct |
33 ms |
2128 KB |
Output is correct |
23 |
Correct |
35 ms |
2128 KB |
Output is correct |
24 |
Correct |
34 ms |
1956 KB |
Output is correct |