답안 #125620

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
125620	2019-07-06T05:33:13 Z	gs14004	Stove (JOI18_stove)	C++17	100 / 100	27 ms	1908 KB

stove

#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;

vector<int> v;

int main(){
	int n, k, p;
	scanf("%d %d %d",&n,&k,&p);
	for(int i=1; i<n; i++){
		int q;
		scanf("%d",&q);
		v.push_back(q - p - 1);
		p = q;
	}
	sort(v.begin(), v.end());
	int ans = n;
	for(int i=0; i<n-k; i++) ans += v[i];
	cout << ans << endl;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:9:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d",&n,&k,&p);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~
stove.cpp:12:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&q);
   ~~~~~^~~~~~~~~

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct

Subtask #2

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	3 ms	380 KB	Output is correct
11	Correct	3 ms	376 KB	Output is correct
12	Correct	3 ms	376 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	3 ms	376 KB	Output is correct
15	Correct	3 ms	380 KB	Output is correct

Subtask #3

50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	256 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	3 ms	380 KB	Output is correct
11	Correct	3 ms	376 KB	Output is correct
12	Correct	3 ms	376 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	3 ms	376 KB	Output is correct
15	Correct	3 ms	380 KB	Output is correct
16	Correct	27 ms	1908 KB	Output is correct
17	Correct	26 ms	1780 KB	Output is correct
18	Correct	27 ms	1780 KB	Output is correct
19	Correct	27 ms	1908 KB	Output is correct
20	Correct	27 ms	1880 KB	Output is correct
21	Correct	27 ms	1776 KB	Output is correct
22	Correct	27 ms	1908 KB	Output is correct
23	Correct	27 ms	1908 KB	Output is correct
24	Correct	27 ms	1780 KB	Output is correct