# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
210189 |
2020-03-16T19:34:40 Z |
grobar |
Stove (JOI18_stove) |
C++14 |
|
5 ms |
256 KB |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int a[n];
// vector< pair<int,int> >par;
int sum=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
//par.push_back(make_pair(a[i],a[i]+1));
}
if(k==1)
{
cout<<sum<<endl;
return 0;
}
if(k==n)
{
cout<<k<<endl;
return 0;
}
int kk=a[n-1]-a[0]+1;
vector<int>v;
for(int i=0;i<=(n-2);i++)
{
v.push_back(a[i+1]-a[i]-1);
}
sort(v.rbegin(),v.rend());
for(int i=0;i<k-1;i++)
{
kk=kk-v[i];
}
cout<<kk<<endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |