Submission #987591

# Submission time Handle Problem Language Result Execution time Memory
987591 2024-05-23T06:38:32 Z Tsagana Stove (JOI18_stove) C++14
100 / 100
21 ms 3200 KB
#include<bits/stdc++.h>

#define IOS ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define all(x) x.begin(), x.end()
#define int long long
#define pq priority_queue
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define eb emplace_back
#define F first
#define S second

using namespace std;

void solve () {
	int n, match; cin >> n >> match;

	match--;
	pq<int> q;
	vector<int> v;

	for (int i = 0; i < n; i++) {
		int a1; cin >> a1; 
		if (i) q.push(a1 - v.back() - 1);
		v.pb(a1);
	}
	int ans = v.back() - v[0] + 1;

	while ((match > 0) && (!q.empty())) {
		ans -= q.top();
		q.pop();
		match--;
	}
	cout << ans;
}
signed main() {IOS solve(); return 0;}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 452 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 12 ms 3020 KB Output is correct
17 Correct 11 ms 3044 KB Output is correct
18 Correct 11 ms 3024 KB Output is correct
19 Correct 12 ms 3024 KB Output is correct
20 Correct 21 ms 3200 KB Output is correct
21 Correct 20 ms 3024 KB Output is correct
22 Correct 20 ms 3024 KB Output is correct
23 Correct 20 ms 3020 KB Output is correct
24 Correct 21 ms 3024 KB Output is correct