oj.uz

Submission #154329

# Submission time Handle Problem Language Result Execution time Memory
154329 2019-09-20T17:13:13 Z ivandasfs Stove (JOI18_stove) C++14
100 / 100
 30 ms 2144 KB 
#include <iostream>
#include <algorithm>

using namespace std;

int a[100005];
int b[100005];

int main() {
	int n, k;
	scanf("%d%d", &n, &k);
	int sol = n;
	for (int i=0 ; i<n ; i++) {
		scanf("%d", a+i);
	}
	sort(a, a+n);
	for (int i=0 ; i<n-1 ; i++) {
		b[i] = a[i+1] - a[i] - 1;
	}
	sort(b, b+n-1);
	for (int i=0 ; i<n-k ; i++) {
		sol += b[i];
	}
	printf("%d\n", sol);
	return 0;
}

Compilation message

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

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 380 KB Output is correct
13 Correct 3 ms 380 KB Output is correct
14 Correct 3 ms 380 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 29 ms 2140 KB Output is correct
17 Correct 29 ms 2040 KB Output is correct
18 Correct 29 ms 2040 KB Output is correct
19 Correct 30 ms 2040 KB Output is correct
20 Correct 30 ms 2004 KB Output is correct
21 Correct 29 ms 2040 KB Output is correct
22 Correct 29 ms 2144 KB Output is correct
23 Correct 29 ms 2040 KB Output is correct
24 Correct 29 ms 2040 KB Output is correct