oj.uz

Submission #171701

# Submission time Handle Problem Language Result Execution time Memory
171701 2019-12-30T06:33:50 Z dennisstar Stove (JOI18_stove) C++11
100 / 100
 33 ms 2480 KB 
#include <bits/stdc++.h>
using namespace std;
 
int n, k, t[100010];
priority_queue<int, vector<int>, greater<int> > pq;
 
int main() {
	scanf("%d %d", &n, &k);
	int ans=n, i;
	for (i=0; i<n; i++) scanf("%d", &t[i]);
	for (i=0; i<n-1; i++) pq.push(t[i+1]-t[i]-1);
	for (i=0; i<n-k; i++) { ans+=pq.top(); pq.pop(); }
	printf("%d\n", ans);
	return 0;
}

Compilation message

stove.cpp: In function 'int main()':
stove.cpp:8: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:10:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (i=0; i<n; i++) scanf("%d", &t[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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 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 2 ms 256 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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 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 2 ms 256 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 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 2 ms 256 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 33 ms 2292 KB Output is correct
17 Correct 33 ms 2352 KB Output is correct
18 Correct 33 ms 2292 KB Output is correct
19 Correct 33 ms 2292 KB Output is correct
20 Correct 28 ms 2292 KB Output is correct
21 Correct 23 ms 2288 KB Output is correct
22 Correct 21 ms 2292 KB Output is correct
23 Correct 21 ms 2480 KB Output is correct
24 Correct 21 ms 2292 KB Output is correct