# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1033607 |
2024-07-25T04:05:37 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
18 ms |
2024 KB |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5;
int n,i,a[N+5],k,dif[N+5],ans;
void Sol(){
cin>>n>>k;
for(i=1;i<=n;i++) cin>>a[i];
for(i=1;i<n;i++)
{
dif[i]=a[i+1]-a[i]-1;
}
sort(dif+1,dif+n);
k=n-k;
ans=n;
for(i=1;i<=k;i++) ans+=dif[i];
cout<<ans;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
Sol();
return 0;
}
# |
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 |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 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 |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 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 |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 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 |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 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 |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
16 |
Correct |
14 ms |
1884 KB |
Output is correct |
17 |
Correct |
13 ms |
2020 KB |
Output is correct |
18 |
Correct |
18 ms |
1884 KB |
Output is correct |
19 |
Correct |
15 ms |
1884 KB |
Output is correct |
20 |
Correct |
13 ms |
1880 KB |
Output is correct |
21 |
Correct |
13 ms |
1884 KB |
Output is correct |
22 |
Correct |
14 ms |
2016 KB |
Output is correct |
23 |
Correct |
14 ms |
1884 KB |
Output is correct |
24 |
Correct |
12 ms |
2024 KB |
Output is correct |