답안 #1091915

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091915 2024-09-22T14:28:53 Z vjudge1 Stove (JOI18_stove) C++17
100 / 100
21 ms 2272 KB
#include <bits/stdc++.h>
#define ll long long int
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define PB push_back
#define PF push_front
#define MOD 1000000007
#define intxt freopen("input.txt","r",stdin)
#define outtxt freopen("output.txt","w",stdout)

using namespace std;

const int MAXN = 2e5 + 10;
int n ,k ,a[MAXN];
vector <int> v;

int main() {
	
	ios_base::sync_with_stdio(0);
	
	cin >> n >> k;
	
	for(int i = 1 ; i <= n ; i++) {
		cin >> a[i];
	}
	sort(a + 1 , a + n + 1);
	for(int i = 2 ; i <= n ; i++) {
		v.PB(a[i] - a[i - 1] - 1);
	}
	sort(v.begin() , v.end());
	
	int ans = n;
	for(int i = 0 ; i < n - k ; i++) {
		ans += v[i];
	}
	
	cout << ans;
}
//Hello
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 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 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 344 KB Output is correct
13 Correct 1 ms 348 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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 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 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 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 16 ms 2248 KB Output is correct
17 Correct 16 ms 2268 KB Output is correct
18 Correct 15 ms 2272 KB Output is correct
19 Correct 16 ms 2272 KB Output is correct
20 Correct 15 ms 2272 KB Output is correct
21 Correct 21 ms 2268 KB Output is correct
22 Correct 15 ms 2272 KB Output is correct
23 Correct 14 ms 2272 KB Output is correct
24 Correct 15 ms 2272 KB Output is correct