oj.uz

답안 #529989

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
529989 2022-02-24T09:17:05 Z nguyentunglam Stove (JOI18_stove) C++14
100 / 100
 45 ms 2868 KB 
#include<bits/stdc++.h>
#define forin(i,a,b) for(int i=a; i <= b; i++)
#define forde(i, a, b) for(int i = a; i <= b; i--)
using namespace std;
const int N = 1e5 + 10; 
long long a[N], b[N];
int main()
{
	int n, k; cin >> n >> k;
	forin(i, 1, n) cin>>a[i];
	long long res = a[n] + 1 - a[1]; 
	forin(i, 2, n) b[i-1] = a[i] - a[i-1];
	sort (b + 1, b + n, greater<int>());
	k = min (k, n ) ;
	forin(i, 1, k-1 ) res -= b[i] - 1; 
	cout << res;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 216 KB Output is correct
8 Correct 0 ms 216 KB Output is correct
9 Correct 0 ms 316 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 216 KB Output is correct
8 Correct 0 ms 216 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 3 ms 356 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 216 KB Output is correct
8 Correct 0 ms 216 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 3 ms 356 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 42 ms 2784 KB Output is correct
17 Correct 43 ms 2868 KB Output is correct
18 Correct 42 ms 2804 KB Output is correct
19 Correct 43 ms 2712 KB Output is correct
20 Correct 43 ms 2704 KB Output is correct
21 Correct 45 ms 2756 KB Output is correct
22 Correct 43 ms 2732 KB Output is correct
23 Correct 42 ms 2788 KB Output is correct
24 Correct 43 ms 2696 KB Output is correct