oj.uz

답안 #903936

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
903936 2024-01-11T14:53:26 Z zhasyn Stove (JOI18_stove) C++17
100 / 100
 20 ms 2524 KB 
#include <bits/stdc++.h>
using namespace std;
int arr[100010];
int main() {
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
  	int n, k, ans = 0;
  	cin >> n >> k;
  	for(int i = 0; i < n; i++){
  		cin >> arr[i];
  	}
  	sort(arr, arr + n);
  	vector <int> w;
  	int cur = arr[0], fir = arr[0], cnt = 1;
  	for(int i = 1; i < n; i++){
  		if(arr[i] - cur <= 1) cur = arr[i];
  		else{
  			ans += (cur - fir + 1);
  			cnt++;
  			w.push_back({arr[i] - cur - 1});
  			cur = fir = arr[i];
  		}
  	}
  	ans += (cur - fir + 1);
  	sort(w.begin(), w.end());
  	for(int i = 0; i < (cnt - k); i++){
  		ans += w[i];
  	}
  	cout << ans;
  	return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 0 ms 360 KB Output is correct
8 Correct 0 ms 360 KB Output is correct
9 Correct 0 ms 360 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 0 ms 360 KB Output is correct
8 Correct 0 ms 360 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 1 ms 508 KB Output is correct
11 Correct 1 ms 360 KB Output is correct
12 Correct 1 ms 416 KB Output is correct
13 Correct 1 ms 360 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 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 1 ms 344 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 0 ms 360 KB Output is correct
8 Correct 0 ms 360 KB Output is correct
9 Correct 0 ms 360 KB Output is correct
10 Correct 1 ms 508 KB Output is correct
11 Correct 1 ms 360 KB Output is correct
12 Correct 1 ms 416 KB Output is correct
13 Correct 1 ms 360 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 19 ms 2272 KB Output is correct
17 Correct 20 ms 2380 KB Output is correct
18 Correct 16 ms 2524 KB Output is correct
19 Correct 16 ms 2272 KB Output is correct
20 Correct 15 ms 2272 KB Output is correct
21 Correct 16 ms 2272 KB Output is correct
22 Correct 15 ms 2268 KB Output is correct
23 Correct 17 ms 2272 KB Output is correct
24 Correct 16 ms 2268 KB Output is correct