답안 #923182

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
923182 2024-02-06T19:56:51 Z LucaLucaM Stove (JOI18_stove) C++17
100 / 100
16 ms 4320 KB
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cstring>
#warning That's the baby, that's not my baby
 
typedef long long ll;
 
const int NMAX = 1e6;
 
int a[NMAX + 1];
 
/**
 
dp[i][j] =def= timpul minim daca rezolv primele i, termin opresc la momentul a[i] + 1 si folosesc j
 
 
dp[i][j] = 1 + min(dp[i - 1][j] + t[i] - t[i - 1], dp[i - 1][j - 1])
 
defapt nu pot doar sa scot cele mai mari k diferente sau cv?
 
**/
 
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(0);
 
  int n, k;
  std::cin >> n >> k;
 
  a[0] = -1;
  for (int i = 1; i <= n; i++) {
    std::cin >> a[i];
  }
  std::vector<int> diff;
  k--; /// ca sa pornesc primu
  for (int i = 2; i <= n; i++) {
    diff.push_back(a[i] - a[i - 1] - 1);
  }
  std::sort(diff.begin(), diff.end());
  std::reverse(diff.begin(), diff.end());
 
  int answer = a[n] - a[1] + 1;
  for (int i = 0; i < k; i++) {
    answer -= diff[i];
  }
  std::cout << answer;
 
  return 0;
}

Compilation message

stove.cpp:6:2: warning: #warning That's the baby, that's not my baby [-Wcpp]
    6 | #warning That's the baby, that's not my baby
      |  ^~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 600 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 600 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 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 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 600 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 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 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 14 ms 4064 KB Output is correct
17 Correct 14 ms 4320 KB Output is correct
18 Correct 14 ms 4064 KB Output is correct
19 Correct 15 ms 4320 KB Output is correct
20 Correct 15 ms 4064 KB Output is correct
21 Correct 14 ms 4320 KB Output is correct
22 Correct 16 ms 4316 KB Output is correct
23 Correct 15 ms 4320 KB Output is correct
24 Correct 14 ms 4224 KB Output is correct