oj.uz

Submission #42266

# Submission time Handle Problem Language Result Execution time Memory
42266 2018-02-24T18:37:37 Z RezwanArefin01 Stove (JOI18_stove) C++14
100 / 100
 44 ms 1528 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii; 

const int maxn = 1e5 + 10;
int a[maxn], n, k;

int main(int argc, char const *argv[]) {
#ifdef LOCAL_TESTING
	freopen("in", "r", stdin);
#endif
	scanf("%d %d", &n, &k);
	vector<int> v; 
	for(int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		if(i > 1) v.push_back(a[i - 1] - a[i]);
	}
	sort(v.begin(), v.end());
	int ans = a[n] - a[1] + k;
	for(int i = 0; i < k - 1; i++) ans += v[i];
 	cout << ans << endl;
}

Compilation message

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

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 424 KB Output is correct
5 Correct 1 ms 424 KB Output is correct
6 Correct 2 ms 496 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 1 ms 568 KB Output is correct
9 Correct 2 ms 568 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 424 KB Output is correct
5 Correct 1 ms 424 KB Output is correct
6 Correct 2 ms 496 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 1 ms 568 KB Output is correct
9 Correct 2 ms 568 KB Output is correct
10 Correct 2 ms 608 KB Output is correct
11 Correct 2 ms 608 KB Output is correct
12 Correct 2 ms 608 KB Output is correct
13 Correct 3 ms 608 KB Output is correct
14 Correct 2 ms 608 KB Output is correct
15 Correct 2 ms 608 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 424 KB Output is correct
5 Correct 1 ms 424 KB Output is correct
6 Correct 2 ms 496 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 1 ms 568 KB Output is correct
9 Correct 2 ms 568 KB Output is correct
10 Correct 2 ms 608 KB Output is correct
11 Correct 2 ms 608 KB Output is correct
12 Correct 2 ms 608 KB Output is correct
13 Correct 3 ms 608 KB Output is correct
14 Correct 2 ms 608 KB Output is correct
15 Correct 2 ms 608 KB Output is correct
16 Correct 44 ms 1512 KB Output is correct
17 Correct 27 ms 1512 KB Output is correct
18 Correct 26 ms 1512 KB Output is correct
19 Correct 28 ms 1528 KB Output is correct
20 Correct 26 ms 1528 KB Output is correct
21 Correct 26 ms 1528 KB Output is correct
22 Correct 34 ms 1528 KB Output is correct
23 Correct 27 ms 1528 KB Output is correct
24 Correct 27 ms 1528 KB Output is correct