oj.uz

Submission #330793

# Submission time Handle Problem Language Result Execution time Memory
330793 2020-11-26T15:01:04 Z M_W Stove (JOI18_stove) C++14
100 / 100
 25 ms 1128 KB 
#include <bits/stdc++.h>
using namespace std;
int main(){
	int N, K, old, cur;
	int f;
	vector<int> v;
	scanf("%d %d %d", &N, &K, &old);
	f = old;
	for(int i = 1; i < N; i++){
		scanf("%d", &cur);
		v.push_back(cur - old - 1);
		old = cur;
	}
	sort(v.begin(), v.end(), greater<int>());
	int ans = old - f + 1, cnt = 0;
	for(int i = 0; i < K - 1; i++)
		ans -= v[i];
	printf("%d", ans);
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:15:25: warning: unused variable 'cnt' [-Wunused-variable]
   15 |  int ans = old - f + 1, cnt = 0;
      |                         ^~~
stove.cpp:7:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    7 |  scanf("%d %d %d", &N, &K, &old);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
stove.cpp:10:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 |   scanf("%d", &cur);
      |   ~~~~~^~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 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 364 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 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 364 KB Output is correct
16 Correct 23 ms 1128 KB Output is correct
17 Correct 23 ms 1128 KB Output is correct
18 Correct 23 ms 1128 KB Output is correct
19 Correct 25 ms 1128 KB Output is correct
20 Correct 23 ms 1128 KB Output is correct
21 Correct 23 ms 1128 KB Output is correct
22 Correct 23 ms 1128 KB Output is correct
23 Correct 23 ms 1128 KB Output is correct
24 Correct 23 ms 1128 KB Output is correct