oj.uz

Submission #64117

# Submission time Handle Problem Language Result Execution time Memory
64117 2018-08-03T11:30:08 Z keko37 Stove (JOI18_stove) C++14
100 / 100
 37 ms 1908 KB 
#include<iostream>
#include<algorithm>

using namespace std;

const int MAXN = 100005;

long long n, k, sol;
int l[MAXN], d[MAXN];

int main () {
	cin >> n >> k;
	for (int i=0; i<n; i++) {
		scanf("%d", &l[i]);
		if (i) d[i] = l[i] - l[i-1] - 1;
		sol += d[i];
	}
	sort(d+1, d+n);
	for (int i=0; i<k-1; i++) {
		sol -= d[n-1 - i];
	}
	cout << sol + n;
	return 0;
}

Compilation message

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

Subtask #1
20.0 / 20.0

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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 3 ms 440 KB Output is correct
4 Correct 3 ms 648 KB Output is correct
5 Correct 3 ms 648 KB Output is correct
6 Correct 3 ms 648 KB Output is correct
7 Correct 3 ms 648 KB Output is correct
8 Correct 3 ms 648 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 3 ms 648 KB Output is correct
11 Correct 3 ms 704 KB Output is correct
12 Correct 4 ms 736 KB Output is correct
13 Correct 3 ms 768 KB Output is correct
14 Correct 4 ms 840 KB Output is correct
15 Correct 3 ms 944 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 2 ms 360 KB Output is correct
3 Correct 3 ms 440 KB Output is correct
4 Correct 3 ms 648 KB Output is correct
5 Correct 3 ms 648 KB Output is correct
6 Correct 3 ms 648 KB Output is correct
7 Correct 3 ms 648 KB Output is correct
8 Correct 3 ms 648 KB Output is correct
9 Correct 2 ms 648 KB Output is correct
10 Correct 3 ms 648 KB Output is correct
11 Correct 3 ms 704 KB Output is correct
12 Correct 4 ms 736 KB Output is correct
13 Correct 3 ms 768 KB Output is correct
14 Correct 4 ms 840 KB Output is correct
15 Correct 3 ms 944 KB Output is correct
16 Correct 30 ms 1760 KB Output is correct
17 Correct 27 ms 1908 KB Output is correct
18 Correct 34 ms 1908 KB Output is correct
19 Correct 31 ms 1908 KB Output is correct
20 Correct 33 ms 1908 KB Output is correct
21 Correct 32 ms 1908 KB Output is correct
22 Correct 37 ms 1908 KB Output is correct
23 Correct 32 ms 1908 KB Output is correct
24 Correct 30 ms 1908 KB Output is correct