This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin >> a >> b;
vector<int>in,out;
priority_queue<int>pq;
for(int i=0;i<a;i++)
{
int c;
cin >> c;
in.push_back(c);
out.push_back(c+1);
pq.push(in[i]-out[i-1]);
}
//out->in(out+1) to minus
int now=out[a-1]-in[0];
b--;
while(b--)
{
now-=pq.top();
pq.pop();
}
cout << now;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |