oj.uz

Submission #528477

# Submission time Handle Problem Language Result Execution time Memory
528477 2022-02-20T10:54:04 Z georgerapeanu Stove (JOI18_stove) C++11
100 / 100
 32 ms 2276 KB 
#include <bits/stdc++.h>

using namespace std;

int main(){
  
  int n, k;
  scanf("%d %d", &n, &k);

  vector<int> v(n, 0);

  sort(v.begin(), v.end());

  for(auto &it:v){
    scanf("%d", &it);
  }
  vector<int> stuff;
  for(int i = 1;i < n;i++){
    stuff.push_back(v[i] - v[i - 1] - 1);
  }

  int ans = v.back() - v[0] + 1;
  sort(stuff.begin(), stuff.end());
  reverse(stuff.begin(), stuff.end());

  for(int i = 0;i < k - 1;i++){
    ans -= max(0, stuff[i]);
  }

  printf("%d", ans);

  return 0;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:8:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |   scanf("%d %d", &n, &k);
      |   ~~~~~^~~~~~~~~~~~~~~~~
stove.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     scanf("%d", &it);
      |     ~~~~~^~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 304 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 21 ms 2272 KB Output is correct
17 Correct 25 ms 2188 KB Output is correct
18 Correct 19 ms 2184 KB Output is correct
19 Correct 18 ms 2208 KB Output is correct
20 Correct 26 ms 2192 KB Output is correct
21 Correct 19 ms 2188 KB Output is correct
22 Correct 32 ms 2200 KB Output is correct
23 Correct 19 ms 2188 KB Output is correct
24 Correct 19 ms 2276 KB Output is correct