oj.uz

Submission #338284

# Submission time Handle Problem Language Result Execution time Memory
338284 2020-12-22T20:44:57 Z markussie Stove (JOI18_stove) C++17
100 / 100
 29 ms 2156 KB 
#include <cstdio>
#include <algorithm>

using namespace std;

const int mxn = 1e5;

int a[mxn+1];
int d[mxn+1];

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

  for(int i = 0; i < n; ++i)
    scanf("%d", &a[i]);

  sort(a, a + n);
  
  long long ans = a[n-1] - a[0] + 1;
  for(int i = 1; i < n; ++i)
    d[i-1] = a[i] - a[i-1] - 1;
  sort(d, d + n-1);

  for(int i = 1; i < k; ++i)
    ans -= d[n-1-i];
  printf("%lld", ans);
  return 0;
}

Compilation message

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

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 268 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 372 KB Output is correct
16 Correct 25 ms 2028 KB Output is correct
17 Correct 26 ms 2028 KB Output is correct
18 Correct 26 ms 2028 KB Output is correct
19 Correct 29 ms 2028 KB Output is correct
20 Correct 26 ms 2112 KB Output is correct
21 Correct 26 ms 2028 KB Output is correct
22 Correct 28 ms 2156 KB Output is correct
23 Correct 25 ms 2028 KB Output is correct
24 Correct 25 ms 2028 KB Output is correct