-
Notifications
You must be signed in to change notification settings - Fork 0
/
C.cpp
67 lines (52 loc) · 1.02 KB
/
C.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve()
{
int n, m;
cin >> n >> m;
m--;
vector<ll> a(n), pref(n, 0);
for (auto &x : a) cin >> x;
for (int i = 0; i < n; i++) {
pref[i] = a[i];
if (i > 0) pref[i] += pref[i - 1];
}
ll ans = 0, curr = pref[m];
priority_queue<ll> max_heap;
for (int i = m; i >= 0; i--) {
while (pref[i] < curr) {
ll x = max_heap.top();
max_heap.pop();
curr -= (2LL * x);
ans++;
}
max_heap.push(a[i]);
}
priority_queue<ll, vector<ll>, greater<ll>> min_heap;
curr = pref[m];
for (int i = m + 1; i < n; i++) {
min_heap.push(a[i]);
while (pref[i] < curr) {
ll x = min_heap.top();
min_heap.pop();
curr += (2LL * x);
ans++;
}
}
cout << ans << '\n';
}
int main()
{
#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
//freopen("Error.txt", "w", stderr);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
int t = 1;
cin >> t;
while (t--) solve();
return 0;
}