답안 #915244

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
915244 2024-01-23T14:49:36 Z SmuggingSpun Stove (JOI18_stove) C++14
100 / 100
21 ms 2528 KB
#include<bits/stdc++.h>
#define taskname "stove"
using namespace std;
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	if(fopen(taskname".inp", "r")){
		freopen(taskname".inp", "r", stdin);
	}
	int n, k;
	cin >> n >> k;
	vector<int>t(n);
	for(int& x : t){
		cin >> x;
	}
	priority_queue<int>pq;
	for(int i = 1; i < n; i++){
		pq.push(t[i] - t[i - 1] - 1);
	}
	int ans = t[n - 1] - t[0] + 1;
	for(int i = 1; i < k; i++){
		ans -= pq.top();
		pq.pop();
	}
	cout << ans;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:7:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |   freopen(taskname".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 460 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 10 ms 2272 KB Output is correct
17 Correct 10 ms 2272 KB Output is correct
18 Correct 10 ms 2528 KB Output is correct
19 Correct 11 ms 2380 KB Output is correct
20 Correct 15 ms 2268 KB Output is correct
21 Correct 19 ms 2272 KB Output is correct
22 Correct 19 ms 2524 KB Output is correct
23 Correct 21 ms 2272 KB Output is correct
24 Correct 19 ms 2272 KB Output is correct