-
Notifications
You must be signed in to change notification settings - Fork 18
Expand file tree
/
Copy pathC.cpp
More file actions
79 lines (68 loc) · 2.23 KB
/
C.cpp
File metadata and controls
79 lines (68 loc) · 2.23 KB
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
68
69
70
71
72
73
74
75
76
77
78
79
#include <bits/stdc++.h>
#define int long long
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; ++i)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; --i)
#define REP(i,a) for(int i=0,_a=(a); i < _a; ++i)
#define DEBUG(X) { cout << #X << " = " << (X) << endl; }
#define PR(A,n) { cout << #A << " = "; FOR(_,1,n) cout << A[_] << ' '; cout << endl; }
#define PR0(A,n) { cout << #A << " = "; REP(_,n) cout << A[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
#define __builtin_popcount __builtin_popcountll
#define SZ(x) ((int) (x).size())
using namespace std;
double safe_sqrt(double x) {
return sqrt(max((double)0.0,x));
}
int GI(ll& x) {
return scanf("%lld", &x);
}
char tmp[1011];
#undef int
int main() {
#define int long long
ios :: sync_with_stdio(0); cin.tie(0);
cout << (fixed) << setprecision(9);
int nq;
while (GI(nq) == 1) {
vector< pair<string,int> > res;
multiset<int> q;
while (nq--) {
int x;
scanf("%s %lld\n", &tmp[0], &x);
if (tmp[0] == 'i') {
q.insert(x);
res.emplace_back("insert", x);
}
else if (tmp[0] == 'r') {
if (q.empty()) {
res.emplace_back("insert", 1);
}
else {
q.erase(q.begin());
}
res.emplace_back("removeMin", -1);
}
else {
while (!q.empty() && *q.begin() < x) {
q.erase(q.begin());
res.emplace_back("removeMin", -1);
}
if (q.empty()) {
q.insert(x);
res.emplace_back("insert", x);
}
else if (*q.begin() > x) {
q.insert(x);
res.emplace_back("insert", x);
}
res.emplace_back("getMin", x);
}
}
printf("%lld\n", SZ(res));
for(auto p : res) {
if (p.first[0] == 'r') printf("%s\n", p.first.c_str());
else printf("%s %lld\n", p.first.c_str(), p.second);
}
}
}