集美大学第15届蓝桥杯大赛(软件类)校内选拔赛

#include <bits/stdc++.h> using namespace std; typedef long long ll; void solveA() { cout << "bei bei shi ji mei da xue zui cai de ren\n"; } void solveB() { int a, b, c, d, e; cin >> a >> b >> c >> d >> e; cout << (int)((a + b + c) * (1 + d * 0.01) * (e * 0.01)) << endl; } void solveC() { //int begin = 2023, end = 20231122; //int ans = 0; //while (begin <= end) //{ // string s = to_string(begin); // int pos = s.find("1122"); // if (pos != -1) // { // ++ans; // } // ++begin; //} //cout << ans; cout << 18152 << endl; } void solveE() { ll n, m; cin >> n >> m; ll ans = 0; ll _min = min(n, m); ll _max = max(n, m); if (_min * 2 < _max) { ans = _min; } else { ans = (n + m) / 3; } cout << ans << endl; } void solveG() { priority_queue<ll, vector<ll>, greater<ll>> pq; ll q; cin >> q; ll s = 0; while (q--) { ll a, x; cin >> a; if (a == 1) { cin >> x; pq.push(x - s); } else if (a == 2) { cout << pq.top() + s << "\n"; pq.pop(); } else { cin >> x; s += x; } } } int main() { int t = 1; //cin >> t; while (t--) { //solveA(); //solveB(); //solveC(); //solveE(); solveG(); } return 0; }