oj.uz

Submission #311215

# Submission time Handle Problem Language Result Execution time Memory
311215 2020-10-09T16:39:47 Z MilosMilutinovic Stove (JOI18_stove) C++14
100 / 100
 57 ms 6436 KB 
/**
 *  author: milos
 *  created: 09.10.2020 18:35:57
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  int ans = a[n - 1] - a[0] + 1;
  multiset<int> s;
  for (int i = 0; i < n - 1; i++) {
    s.insert(a[i + 1] - a[i] - 1);
  }  
  for (int i = 0; i < k - 1; i++) {
    if (s.empty()) {
      break;
    }       
    auto it = prev(s.end());
    ans -= *it;
    s.erase(it);
  }  
  cout << ans << '\n';
  return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 53 ms 6436 KB Output is correct
17 Correct 52 ms 6396 KB Output is correct
18 Correct 57 ms 6424 KB Output is correct
19 Correct 50 ms 6392 KB Output is correct
20 Correct 56 ms 6392 KB Output is correct
21 Correct 53 ms 6392 KB Output is correct
22 Correct 50 ms 6392 KB Output is correct
23 Correct 54 ms 6392 KB Output is correct
24 Correct 51 ms 6396 KB Output is correct