oj.uz

Submission #941222

# Submission time Handle Problem Language Result Execution time Memory
941222 2024-03-08T09:49:02 Z freedommo33 Stove (JOI18_stove) C++17
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;
constexpr int M = 100005;
int tab[M];

bool czy(int a, int b){ return b<a; }
int main(){
	cin.tie(0)->sync_with_stdio(0);
	int n, k;
	cin>>n>>k;
	tab[0] = 0;
	for(int i=1; i<=n; i++) cin>>tab[i];
	vector<int> przerwy;
	for(int i=n; i>=1; i--){
		przerwy.push_back(tab[i]-tab[i-1]-1);
	}
	sort(przerwy.begin(), przerwy.end(), czy);
	int ile = 0;
	for(int i=1; i<=k-1; i++) ile+=przerwy[i-1];
	cout<<tab[n] - ile<<endl;
	return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 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 344 KB Output is correct
2 Incorrect 0 ms 348 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 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -