답안 #1023344

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1023344	2024-07-14T16:37:17 Z	biserailieva	Stove (JOI18_stove)	C++14	100 / 100	42 ms	2292 KB

stove

#include<bits/stdc++.h>
using namespace std;
 
using ll = long long;
 
const int MXN=1e5+5;
 
int n, k, t[MXN];
 
int main() {
	cin >> n >> k;
	vector<int> vec;
	for(int i=1; i<=n; i++)
	{
		cin >> t[i];
		if(i>1)
		{
		    vec.push_back(t[i]-t[i-1]-1);
		}
	}
	sort(vec.begin(), vec.end());
	ll ans=n;
	for(int i=0; i<n-k; i++)
	{
		ans += vec[i];
	}
	cout << ans << '\n';
	return 0;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 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	400 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct

Subtask #2

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 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	400 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	2 ms	348 KB	Output is correct
13	Correct	2 ms	344 KB	Output is correct
14	Correct	1 ms	600 KB	Output is correct
15	Correct	2 ms	344 KB	Output is correct

Subtask #3

50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 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	400 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	2 ms	348 KB	Output is correct
13	Correct	2 ms	344 KB	Output is correct
14	Correct	1 ms	600 KB	Output is correct
15	Correct	2 ms	344 KB	Output is correct
16	Correct	30 ms	2060 KB	Output is correct
17	Correct	31 ms	2292 KB	Output is correct
18	Correct	31 ms	2224 KB	Output is correct
19	Correct	33 ms	2252 KB	Output is correct
20	Correct	32 ms	2260 KB	Output is correct
21	Correct	42 ms	2188 KB	Output is correct
22	Correct	31 ms	2260 KB	Output is correct
23	Correct	31 ms	2264 KB	Output is correct
24	Correct	32 ms	2100 KB	Output is correct