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 int long long
using namespace std ;
const int maxn = 1e5 + 5 ;
int n, k, a, t[maxn], in[maxn] ;
int32_t main(){
cin >> n >> k ;
cin >> a ;
int timer = 1 ;
for(int i = 1, ta ; i < n ; i++){
cin >> ta ;
t[i] = ta - a - 1 ;
timer += (t[i] + 1) ;
a = ta ;
}
sort(in + 1, in + 1 + n) ; reverse(in + 1, in + 1 + n) ;
for(int i = 1 ; i <= k ; i++) timer -= (in[i] + 1) ;
cout << timer << "\n" ;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |