답안 #729348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
729348 2023-04-24T00:13:35 Z pcc Stove (JOI18_stove) C++14
100 / 100
24 ms 2260 KB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define fs first
#define sc second


void solve(){
	ll n,k;
	cin>>n>>k;
	k--;
	ll arr[n];
	for(auto &i:arr)cin>>i;
	sort(arr,arr+n);
	priority_queue<ll,vector<ll>,less<ll>> pq;
	pq.push(0);
	ll total = arr[n-1]-arr[0]+1;
	for(int i = 1;i<n;i++)pq.push(arr[i]-arr[i-1]-1);
	while(k--){
		total -= pq.top();
		pq.pop();
	}
	cout<<total;
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t = 1;
	while(t--)solve();
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 14 ms 2252 KB Output is correct
17 Correct 13 ms 2260 KB Output is correct
18 Correct 16 ms 2244 KB Output is correct
19 Correct 14 ms 2260 KB Output is correct
20 Correct 18 ms 2252 KB Output is correct
21 Correct 22 ms 2248 KB Output is correct
22 Correct 23 ms 2248 KB Output is correct
23 Correct 24 ms 2252 KB Output is correct
24 Correct 23 ms 2248 KB Output is correct