| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1037338 |
2024-07-28T14:18:03 Z |
ivaziva |
Stove (JOI18_stove) |
C++14 |
|
31 ms |
3340 KB |
#include <bits/stdc++.h>
using namespace std;
#define MAXN 100001
long long n,k;
long long a[MAXN];
vector<long long> raz;
int main()
{
cin>>n>>k;
for (long long i=1;i<=n;i++) cin>>a[i];
for (long long i=2;i<=n;i++) raz.push_back(a[i]-a[i-1]-1);
sort(raz.begin(),raz.end());
long long ans=n;
for (long long i=0;i<n-k;i++) ans+=raz[i];
cout<<ans<<endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
444 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
444 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
444 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
444 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 |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
444 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
444 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 |
29 ms |
3284 KB |
Output is correct |
| 17 |
Correct |
29 ms |
3224 KB |
Output is correct |
| 18 |
Correct |
29 ms |
3272 KB |
Output is correct |
| 19 |
Correct |
29 ms |
3120 KB |
Output is correct |
| 20 |
Correct |
29 ms |
3280 KB |
Output is correct |
| 21 |
Correct |
29 ms |
3284 KB |
Output is correct |
| 22 |
Correct |
29 ms |
3340 KB |
Output is correct |
| 23 |
Correct |
31 ms |
3108 KB |
Output is correct |
| 24 |
Correct |
29 ms |
3284 KB |
Output is correct |
