답안 #542048

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
542048 2022-03-25T09:09:00 Z lunchbox Stove (JOI18_stove) C++17
100 / 100
20 ms 1696 KB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, k, ans;
	scanf("%d%d", &n, &k), k--;
	vector<int> a(n);
	for (int &x : a)
		scanf("%d", &x);
	ans = a[n - 1] - a[0] + 1;
	for (int i = 0; i + 1 < n; i++)
		a[i] = a[i + 1] - a[i] - 1;
	a.pop_back();
	sort(a.rbegin(), a.rend());
	for (int i = 0; i < k; i++)
		ans -= a[i];
	printf("%d\n", ans);
	return 0;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:6:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 |  scanf("%d%d", &n, &k), k--;
      |  ~~~~~^~~~~~~~~~~~~~~~
stove.cpp:9:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |   scanf("%d", &x);
      |   ~~~~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 0 ms 300 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 0 ms 300 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 0 ms 300 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 436 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 20 ms 1584 KB Output is correct
17 Correct 19 ms 1580 KB Output is correct
18 Correct 20 ms 1696 KB Output is correct
19 Correct 19 ms 1592 KB Output is correct
20 Correct 19 ms 1580 KB Output is correct
21 Correct 18 ms 1592 KB Output is correct
22 Correct 18 ms 1572 KB Output is correct
23 Correct 18 ms 1572 KB Output is correct
24 Correct 19 ms 1620 KB Output is correct