oj.uz

답안 #1055440

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1055440 2024-08-12T19:32:41 Z alex_2008 Stove (JOI18_stove) C++14
100 / 100
 15 ms 2548 KB 
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int a[N];
int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int n, k;
	cin >> n >> k;
	k--;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	int ans = a[n] - a[1] + 1;
	vector <int> v;
	for (int i = 1; i < n; i++) {
		v.push_back(a[i + 1] - a[i] - 1);
	}
	sort(v.begin(), v.end());
	reverse(v.begin(), v.end());
	for (int i = 0; i < k; i++) {
		ans -= v[i];
	}
	cout << ans << "\n";
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 420 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 348 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 420 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 476 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 540 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 420 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 476 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 540 KB Output is correct
16 Correct 11 ms 2396 KB Output is correct
17 Correct 11 ms 2272 KB Output is correct
18 Correct 11 ms 2268 KB Output is correct
19 Correct 11 ms 2272 KB Output is correct
20 Correct 12 ms 2272 KB Output is correct
21 Correct 11 ms 2288 KB Output is correct
22 Correct 11 ms 2272 KB Output is correct
23 Correct 11 ms 2272 KB Output is correct
24 Correct 15 ms 2548 KB Output is correct