# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66719 | yusufake | Stove (JOI18_stove) | C++98 | 57 ms | 10656 KiB |
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;
#define mp make_pair
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef pair < int , int > pp;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
priority_queue < int > Q;
int A[N],n,k,i,ans;
int main(){
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++) scanf("%d",&A[i]);
sort(A+1 , A+n+1);
ans = A[n] - A[1] + 1;
for(i=2;i<=n;i++)
Q.push(A[i]-A[i-1]-1);
for(;--k;){
ans -= Q.top();
Q.pop();
}
printf("%d",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |