oj.uz

답안 #944273

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
944273 2024-03-12T13:33:36 Z dugersuren Stove (JOI18_stove) C++17
100 / 100
 15 ms 2300 KB 
# include <bits/stdc++.h>
#define ll long long
#define MAX 100003
using namespace std;
int n, k, t[MAX]; 
int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin>>n>>k;
    vector <int> e;
    for (int i = 1; i <= n; ++i) {
        cin >> t[i];
        if (i > 1) e.push_back(t[i] - t[i - 1] - 1);
    }
    sort(e.rbegin(), e.rend());
    int ans = t[n] + 1 - t[1];
    
    	
    for (int i = 0; i < min(((int)e.size()), k - 1); ++i) ans -= e[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 344 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 468 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 344 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 468 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 372 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 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 344 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 468 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 372 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 14 ms 2268 KB Output is correct
17 Correct 15 ms 2288 KB Output is correct
18 Correct 14 ms 2268 KB Output is correct
19 Correct 14 ms 2300 KB Output is correct
20 Correct 14 ms 2268 KB Output is correct
21 Correct 14 ms 2264 KB Output is correct
22 Correct 14 ms 2264 KB Output is correct
23 Correct 14 ms 2268 KB Output is correct
24 Correct 14 ms 2268 KB Output is correct