# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1049695 |
2024-08-09T04:16:01 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
26 ms |
3104 KB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
ll t[100001];
int main() {
ll n,k;
cin>>n>>k;
ll ans=n;
vector<ll> wt;
for(ll i=0; i<n; i++) {
cin>>t[i];
if(i)
wt.push_back(t[i]-t[i-1]-1);
}
if(k<n) {
sort(wt.begin(),wt.end());
for(int i=0; i<n-k; i++)
ans+=wt[i];
}
cout<<ans;
}
# |
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 |
448 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
604 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 |
448 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
604 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
2 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 |
448 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
604 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
2 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 |
24 ms |
3024 KB |
Output is correct |
17 |
Correct |
26 ms |
3012 KB |
Output is correct |
18 |
Correct |
24 ms |
3020 KB |
Output is correct |
19 |
Correct |
24 ms |
3048 KB |
Output is correct |
20 |
Correct |
24 ms |
3012 KB |
Output is correct |
21 |
Correct |
24 ms |
3024 KB |
Output is correct |
22 |
Correct |
24 ms |
3024 KB |
Output is correct |
23 |
Correct |
24 ms |
3104 KB |
Output is correct |
24 |
Correct |
25 ms |
3024 KB |
Output is correct |