oj.uz

Submission #734060

# Submission time Handle Problem Language Result Execution time Memory
734060 2023-05-01T15:27:48 Z LCJLY Stove (JOI18_stove) C++14
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>  //needa retype template incase bret reynold yeah bruh moment ill me
using namespace std;

#define int long long 
typedef pair<int,int>pii;

int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,k;
	cin >> n >> k;

	int arr[n+5];

	for(int x=1;x<=n;x++){
		cin >> arr[x];
	}

	priority_queue<int>pq;
	for(int x=2;x<=n;x++){
		pq.push(arr[x]-arr[x-1]-1);
	}

	int counter=n;

    for(int bruh=0; bruh<n-k-1; ++bruh) {
        auto cur=pq.top();
        counter-=cur;
        pq.pop();
	}
	cout << counter;
}
/*
10 5
1
2
5
6
8
11
13
15
16
20
*/

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -