| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 | 
|---|---|---|---|---|---|---|---|
| 1257448 | iq500 | Stove (JOI18_stove) | C++20 | 28 ms | 1096 KiB | 
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> g, gh, comps;
int main(){
	int n, k; cin>>n>>k;
	int arr[n], ara[n-1];
	for(int i=0; i<n; i++){
		cin>>arr[i];
		if(i!=0){
			ara[i-1]=arr[i]-arr[i-1];
		}
	}
	sort(ara, ara+n-1);
	int ans=k;
	for(int i=0; i<n-k; i++){
		ans+=ara[i];
	}
	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... | ||||
