oj.uz

Submission #486852

# Submission time Handle Problem Language Result Execution time Memory
486852 2021-11-13T01:39:27 Z TypeYippie Stove (JOI18_stove) C++14
100 / 100
 19 ms 2036 KB 
#include <bits/stdc++.h>
using namespace std;

int main(){
	int n, k, time[100005], interval[100005];
	scanf("%d%d", &n, &k);
	for(int i = 0; i < n; i++){
		scanf("%d", time+i);
		if(i > 0){
			interval[i-1] = time[i]-time[i-1]-1;
		}
	} 
	sort(interval, interval+n-1, greater<int>());
	int ans = time[n-1]-time[0]+1;
	for(int i = 0; i < k-1; i++){
		ans -= interval[i];
	}
	printf("%d\n", ans);

	return 0;
}

Compilation message

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

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1088 KB Output is correct
15 Correct 1 ms 1100 KB Output is correct
16 Correct 18 ms 2036 KB Output is correct
17 Correct 17 ms 1996 KB Output is correct
18 Correct 17 ms 1996 KB Output is correct
19 Correct 16 ms 2036 KB Output is correct
20 Correct 17 ms 1952 KB Output is correct
21 Correct 17 ms 1944 KB Output is correct
22 Correct 18 ms 1944 KB Output is correct
23 Correct 19 ms 2028 KB Output is correct
24 Correct 17 ms 2032 KB Output is correct