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>
#define ll long long
using namespace std;
ll in[100005],out[100005],sum=0;
priority_queue<int> keep;
int main()
{
ll guest,open;
cin >> guest >> open;
for(int i=0;i<guest;i++)
{
cin >> in[i];
out[i]=in[i]+1;
}
for(int i=0;i<guest-1;i++)
{
//cout << in[i+1]-out[i] << " ";
keep.push(in[i+1]-out[i]);
}
//cout << out[guest-1] << " " << in[0];
int tungmod=out[guest-1]-in[0];
//cout << tungmod << "\n";
open--;
while(open--)
{
tungmod=tungmod-keep.top();
keep.pop();
}
cout << tungmod;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |