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
#define fi first
#define se second
using namespace std ;
const ll N = 1e5 ;
ll n, k, ans, t[N + 1] ;
vector<ll> v ;
signed main()
{
ios_base::sync_with_stdio( 0 ) ;
cin.tie( 0 ) ;
cout.tie( 0 ) ;
cin >> n >> k ;
k-- ;
for(ll i = 1 ; i <= n ; i++)
cin >> t[i] ;
ans = t[n] + 1 - t[1] ;
for(ll i = 1 ; i < n ; i++)
v.push_back(t[i + 1] - t[i] - 1) ;
sort(v.begin(), v.end()) ;
while(k--)
{
ans -= v.back() ;
v.pop_back() ;
}
cout << ans ;
return 0 ;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |