oj.uz

답안 #952328

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
952328 2024-03-23T14:26:19 Z abczz Stove (JOI18_stove) C++14
100 / 100
 36 ms 3024 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#define ll long long

using namespace std;

vector <ll> V;
ll n, k, f, A[100000];
int main() {
  cin >> n >> k;
  f = n;
  for (int i=0; i<n; ++i) {
    cin >> A[i];
    if (i) V.push_back(A[i]-A[i-1]-1);
  }
  sort(V.begin(), V.end());
  for (int i=0; i<n-k; ++i) {
    f += V[i];
  }
  cout << f << '\n';
}

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 444 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 444 KB Output is correct
9 Correct 0 ms 344 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 444 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 444 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 456 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 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 444 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 444 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 456 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 36 ms 3016 KB Output is correct
17 Correct 35 ms 2900 KB Output is correct
18 Correct 34 ms 3020 KB Output is correct
19 Correct 35 ms 3016 KB Output is correct
20 Correct 35 ms 3020 KB Output is correct
21 Correct 36 ms 3012 KB Output is correct
22 Correct 36 ms 3016 KB Output is correct
23 Correct 35 ms 3012 KB Output is correct
24 Correct 35 ms 3024 KB Output is correct