| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 862877 |
2023-10-19T07:44:37 Z |
20163070 |
Stove (JOI18_stove) |
C++14 |
|
40 ms |
2140 KB |
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,k;
int a[N];
int f[N];
int c[N];
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<n;i++)
{
c[i]=a[i+1]-a[i]-1;
}
sort(c+1,c+n);
int ans=a[n]-a[1]+1;
for(int i=n-1;i>=n-k+1;i--) ans-=c[i];
cout<<ans<<endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 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 |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
444 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 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 |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
444 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
452 KB |
Output is correct |
| 12 |
Correct |
1 ms |
504 KB |
Output is correct |
| 13 |
Correct |
2 ms |
348 KB |
Output is correct |
| 14 |
Correct |
2 ms |
348 KB |
Output is correct |
| 15 |
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 |
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 |
348 KB |
Output is correct |
| 7 |
Correct |
1 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
444 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
452 KB |
Output is correct |
| 12 |
Correct |
1 ms |
504 KB |
Output is correct |
| 13 |
Correct |
2 ms |
348 KB |
Output is correct |
| 14 |
Correct |
2 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
34 ms |
2140 KB |
Output is correct |
| 17 |
Correct |
33 ms |
2096 KB |
Output is correct |
| 18 |
Correct |
34 ms |
2128 KB |
Output is correct |
| 19 |
Correct |
34 ms |
1992 KB |
Output is correct |
| 20 |
Correct |
34 ms |
2140 KB |
Output is correct |
| 21 |
Correct |
33 ms |
2132 KB |
Output is correct |
| 22 |
Correct |
33 ms |
2140 KB |
Output is correct |
| 23 |
Correct |
34 ms |
2132 KB |
Output is correct |
| 24 |
Correct |
40 ms |
2128 KB |
Output is correct |
