oj.uz

Submission #1092079

# Submission time Handle Problem Language Result Execution time Memory
1092079 2024-09-23T05:31:15 Z vjudge1 Stove (JOI18_stove) C++14
0 / 100
 0 ms 436 KB 
//Stove(Vjudge)
#include<bits/stdc++.h>

using namespace std; 

int main(){
	int n, k, cnt = 0; 
	cin >> n >> k; 
	k--;  
	int t[n + 10], dist[n + 10]; 
	for(int i = 0; i < n; i++){
		cin >> t[i]; 
	}
	t[0]++;  
	for(int i = 0; i < n - 1; i++){
		dist[i] = t[i + 1] - t[i]; 
		t[i + 1]++; 
		//cout << dist[i] << endl; 
	}
	sort(dist , dist + n);  
	for(int i = n - 2; i >= n - k - 1; i--){
		cnt += dist[i]; 
	}
	//cout << t[n - 1] << endl; 
	cout << t[n - 1] - cnt - 1 << endl; 
	//cout << cnt << endl; 
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 436 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 436 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 436 KB Output isn't correct
3 Halted 0 ms 0 KB -