# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
127227 |
2019-07-09T07:04:04 Z |
taozai281 |
Stove (JOI18_stove) |
C++14 |
|
89 ms |
1148 KB |
#include<bits/stdc++.h>
using namespace std;
int n,k;
int T[100010];
int d[100010];
int ans=0;
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>T[i];
}
for(int i=2;i<=n;i++)
{
d[i-1]=T[i]-T[i-1];
}
sort(d+1,d+n);
for(int i=1;i<=n-k;i++)
{
ans+=d[i];
}
ans+=k;
cout<<ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
256 KB |
Output is correct |
6 |
Correct |
2 ms |
256 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
256 KB |
Output is correct |
6 |
Correct |
2 ms |
256 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
4 ms |
380 KB |
Output is correct |
11 |
Correct |
4 ms |
376 KB |
Output is correct |
12 |
Correct |
4 ms |
376 KB |
Output is correct |
13 |
Correct |
4 ms |
376 KB |
Output is correct |
14 |
Correct |
5 ms |
376 KB |
Output is correct |
15 |
Correct |
4 ms |
336 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
256 KB |
Output is correct |
6 |
Correct |
2 ms |
256 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
4 ms |
380 KB |
Output is correct |
11 |
Correct |
4 ms |
376 KB |
Output is correct |
12 |
Correct |
4 ms |
376 KB |
Output is correct |
13 |
Correct |
4 ms |
376 KB |
Output is correct |
14 |
Correct |
5 ms |
376 KB |
Output is correct |
15 |
Correct |
4 ms |
336 KB |
Output is correct |
16 |
Correct |
82 ms |
1076 KB |
Output is correct |
17 |
Correct |
83 ms |
1148 KB |
Output is correct |
18 |
Correct |
89 ms |
1136 KB |
Output is correct |
19 |
Correct |
83 ms |
1144 KB |
Output is correct |
20 |
Correct |
84 ms |
1144 KB |
Output is correct |
21 |
Correct |
86 ms |
1144 KB |
Output is correct |
22 |
Correct |
82 ms |
1112 KB |
Output is correct |
23 |
Correct |
83 ms |
1144 KB |
Output is correct |
24 |
Correct |
82 ms |
1144 KB |
Output is correct |