oj.uz

Submission #1005470

# Submission time Handle Problem Language Result Execution time Memory
1005470 2024-06-22T13:30:26 Z jamjanek Stove (JOI18_stove) C++14
100 / 100
 21 ms 2388 KB 
#include<bits/stdc++.h>
using namespace std;
int a[100010], b[100010];
int main()
{
  int n, k, i;
  scanf("%d%d", &n, &k);
  for(i=0;i<n;i++)
    scanf("%d", &a[i]);
  sort(a, a+n);
  for(i=0;i<n-1;i++)b[i] = -(a[i+1]-a[i]-1);
  sort(b, b+n-1);
  int res = a[n-1]-a[0]+1;
  for(i=0;i<k-1;i++)res+=b[i];
  printf("%d\n", res);
}

Compilation message

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

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 348 KB Output is correct
9 Correct 0 ms 604 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 348 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 480 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 348 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 348 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 480 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 348 KB Output is correct
16 Correct 15 ms 2140 KB Output is correct
17 Correct 15 ms 2140 KB Output is correct
18 Correct 15 ms 2140 KB Output is correct
19 Correct 15 ms 2184 KB Output is correct
20 Correct 14 ms 2140 KB Output is correct
21 Correct 15 ms 2184 KB Output is correct
22 Correct 21 ms 2388 KB Output is correct
23 Correct 15 ms 2136 KB Output is correct
24 Correct 15 ms 2172 KB Output is correct