oj.uz

Submission #971861

# Submission time Handle Problem Language Result Execution time Memory
971861 2024-04-29T12:08:40 Z vjudge1 Stove (JOI18_stove) C++17
100 / 100
 22 ms 3376 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 1e5 + 5;
ll a[N];
signed main(){
	int n; ll k; scanf("%d %lld", &n, &k);
	for(int i = 0; i<n; ++i) scanf("%lld", a+i);
	sort(a, a+n);
	vector<ll> v;
	for(int i = 0; i<n-1; ++i) v.push_back(a[i] - a[i+1]);
	sort(v.begin(), v.end());
	ll ans = k + a[n-1] - a[0];
	for(int i = 0; i<k-1; ++i) ans += v[i];
	printf("%lld", ans);
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:7:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 |  int n; ll k; scanf("%d %lld", &n, &k);
      |               ~~~~~^~~~~~~~~~~~~~~~~~~
stove.cpp:8:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |  for(int i = 0; i<n; ++i) scanf("%lld", 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 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 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 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 344 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

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 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 1 ms 344 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 17 ms 3148 KB Output is correct
17 Correct 18 ms 3284 KB Output is correct
18 Correct 20 ms 3284 KB Output is correct
19 Correct 20 ms 3376 KB Output is correct
20 Correct 17 ms 3284 KB Output is correct
21 Correct 21 ms 3280 KB Output is correct
22 Correct 20 ms 3204 KB Output is correct
23 Correct 22 ms 3324 KB Output is correct
24 Correct 19 ms 3280 KB Output is correct