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
| #include<bits/stdc++.h> using namespace std; typedef long long ll;
void slove() { int n; ll ans = 0; cin >> n; priority_queue<int > q; for(int i = 0; i < n; i++ ) { int s; cin >> s; if(s == 0) { if(!q.empty()) { ans += q.top(); q.pop(); } }else { q.push(s); } }
cout << ans << '\n';
}
signed main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while(t--){ slove(); }
return 0;
}
|