# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
76415 |
2018-09-13T13:37:13 Z |
Vasiljko |
Stove (JOI18_stove) |
C++14 |
|
35 ms |
11620 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
const int N = 1e5+5;
int n,k;
ll t[N];
vector<ll>v;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>t[i];
}
ll ans=t[n]+1-t[1];
for(int i=2;i<=n;i++){
v.push_back(t[i]-t[i-1]-1);
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
k--;
for(auto e:v){
if(k){
k--;
ans-=e;
}
}
cout<<ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
3 ms |
640 KB |
Output is correct |
3 |
Correct |
2 ms |
700 KB |
Output is correct |
4 |
Correct |
2 ms |
840 KB |
Output is correct |
5 |
Correct |
2 ms |
848 KB |
Output is correct |
6 |
Correct |
2 ms |
848 KB |
Output is correct |
7 |
Correct |
2 ms |
848 KB |
Output is correct |
8 |
Correct |
2 ms |
848 KB |
Output is correct |
9 |
Correct |
2 ms |
848 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
3 ms |
640 KB |
Output is correct |
3 |
Correct |
2 ms |
700 KB |
Output is correct |
4 |
Correct |
2 ms |
840 KB |
Output is correct |
5 |
Correct |
2 ms |
848 KB |
Output is correct |
6 |
Correct |
2 ms |
848 KB |
Output is correct |
7 |
Correct |
2 ms |
848 KB |
Output is correct |
8 |
Correct |
2 ms |
848 KB |
Output is correct |
9 |
Correct |
2 ms |
848 KB |
Output is correct |
10 |
Correct |
3 ms |
924 KB |
Output is correct |
11 |
Correct |
3 ms |
956 KB |
Output is correct |
12 |
Correct |
3 ms |
956 KB |
Output is correct |
13 |
Correct |
3 ms |
1036 KB |
Output is correct |
14 |
Correct |
3 ms |
1036 KB |
Output is correct |
15 |
Correct |
3 ms |
1100 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
504 KB |
Output is correct |
2 |
Correct |
3 ms |
640 KB |
Output is correct |
3 |
Correct |
2 ms |
700 KB |
Output is correct |
4 |
Correct |
2 ms |
840 KB |
Output is correct |
5 |
Correct |
2 ms |
848 KB |
Output is correct |
6 |
Correct |
2 ms |
848 KB |
Output is correct |
7 |
Correct |
2 ms |
848 KB |
Output is correct |
8 |
Correct |
2 ms |
848 KB |
Output is correct |
9 |
Correct |
2 ms |
848 KB |
Output is correct |
10 |
Correct |
3 ms |
924 KB |
Output is correct |
11 |
Correct |
3 ms |
956 KB |
Output is correct |
12 |
Correct |
3 ms |
956 KB |
Output is correct |
13 |
Correct |
3 ms |
1036 KB |
Output is correct |
14 |
Correct |
3 ms |
1036 KB |
Output is correct |
15 |
Correct |
3 ms |
1100 KB |
Output is correct |
16 |
Correct |
26 ms |
3832 KB |
Output is correct |
17 |
Correct |
27 ms |
4800 KB |
Output is correct |
18 |
Correct |
26 ms |
5764 KB |
Output is correct |
19 |
Correct |
27 ms |
6836 KB |
Output is correct |
20 |
Correct |
26 ms |
7764 KB |
Output is correct |
21 |
Correct |
35 ms |
8848 KB |
Output is correct |
22 |
Correct |
26 ms |
9692 KB |
Output is correct |
23 |
Correct |
26 ms |
10656 KB |
Output is correct |
24 |
Correct |
26 ms |
11620 KB |
Output is correct |