oj.uz

Submission #117634

# Submission time Handle Problem Language Result Execution time Memory
117634 2019-06-17T00:43:17 Z wilwxk Stove (JOI18_stove) C++14
100 / 100
 31 ms 2228 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN=1e5+5;
priority_queue<int> pq;
int v[MAXN];
int n, x;
int resp;

int main() {
	scanf("%d %d", &n, &x);
	for(int i=1; i<=n; i++) {
		scanf("%d", &v[i]);
		if(i!=1) pq.push(v[i]-v[i-1]-1);
	}

	resp=v[n]-v[1]+1; x--;
	while(x--) {
		if(pq.size()) {
			resp-=pq.top();
			pq.pop();
		}
	}

	printf("%d\n", resp);
}

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, &x);
  ~~~~~^~~~~~~~~~~~~~~~~
stove.cpp:13:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &v[i]);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 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 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 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 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 19 ms 2228 KB Output is correct
17 Correct 19 ms 2172 KB Output is correct
18 Correct 20 ms 2172 KB Output is correct
19 Correct 20 ms 2172 KB Output is correct
20 Correct 25 ms 2172 KB Output is correct
21 Correct 30 ms 2164 KB Output is correct
22 Correct 31 ms 2172 KB Output is correct
23 Correct 30 ms 2172 KB Output is correct
24 Correct 29 ms 2148 KB Output is correct