제출 #430702

#제출 시각아이디문제언어결과실행 시간메모리
430702PietraStove (JOI18_stove)C++14
0 / 100
0 ms204 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...