Submission #430698

#TimeUsernameProblemLanguageResultExecution timeMemory
430698PietraStove (JOI18_stove)C++14
0 / 100
1 ms204 KiB
#include<bits/stdc++.h>
#define int long long 
using namespace std ; 

const int maxn = 1e5 + 5 ; 

int n, k, t[maxn], in[maxn] ; 

int32_t main(){

	cin >> n >> k ; 

	for(int i = 1 ; i <= n ; i++) cin >> t[i] ;

	for(int i = 2 ; i <= n ; i++) in[i-1] = abs(t[i] - 1 - t[i-1]) ;

	int timer = 1 ; 
    
    sort(in + 1, in + 1 + n) ; reverse(in + 1, in + 1 + n) ; 

	for(int i = k ; i <= n ; i++) timer += (in[i] + 1) ; 

	cout << timer << "\n" ; 

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...