# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
908889 |
2024-01-17T01:22:50 Z |
slumio |
Stove (JOI18_stove) |
C++17 |
|
15 ms |
2468 KB |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
/*I liked you once but not anymore now*/
void solve(){
int n,k;cin>>n>>k;
vector<int>a(n);
for(int i=0;i<n;i++)
cin>>a[i];
vector<int>b;
for(int i=1;i<n;i++)
{
b.push_back(a[i]-a[i-1]-1);
}
sort(b.begin(),b.end());
ll ans=n;
for(int i=0;i<n-k;i++)
{
ans+=b[i];
}
cout<<ans<<endl;
return;
}
int main()
{
std::ios::sync_with_stdio(false);std::cin.tie(nullptr);std::cout.tie(nullptr);
solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 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 |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 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 |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 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 |
468 KB |
Output is correct |
14 |
Correct |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
508 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 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 |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 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 |
468 KB |
Output is correct |
14 |
Correct |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
508 KB |
Output is correct |
16 |
Correct |
14 ms |
2272 KB |
Output is correct |
17 |
Correct |
15 ms |
2272 KB |
Output is correct |
18 |
Correct |
14 ms |
2272 KB |
Output is correct |
19 |
Correct |
15 ms |
2272 KB |
Output is correct |
20 |
Correct |
15 ms |
2384 KB |
Output is correct |
21 |
Correct |
15 ms |
2272 KB |
Output is correct |
22 |
Correct |
14 ms |
2468 KB |
Output is correct |
23 |
Correct |
15 ms |
2268 KB |
Output is correct |
24 |
Correct |
15 ms |
2272 KB |
Output is correct |