/*
输入样例#1：
1 1 1
1 2 5
2
1 3 3
3
1 5 2
-1
输出样例#1：
8 5
*/

 1 //P2073 送花
 2 #include<iostream>
 3 #include<cstdio>
 4 #include<algorithm>
 5 #include<map>
 6 #define mkp make_pair
 7 #define fi first
 8 #define se second
 9 using namespace std;
10
11 const int MAXN = 1000000 + 1;
12
13 map<int, int> a;
14 bool vis[MAXN];
15
16 int main() {
17     int fl, w, c;
18     while(scanf("%d", &fl) == 1 && fl != -1) {
19         if(fl == 1) {
20             scanf("%d%d", &w, &c);
21             if(vis[c]) continue;
22             a.insert(mkp(c, w));
23             vis[c] = 1;
24         }
25         if(fl == 2) {
26             if(!a.size()) continue;
27             map<int, int>::iterator it;
28             it = a.end();
29             --it; vis[it->fi] = 0;
30             a.erase(it);
31         }
32         if(fl == 3) {
33             if(!a.size()) continue;
34             map<int, int>::iterator it;
35             it = a.begin();
36             vis[it->fi] = 0;
37             a.erase(it);
38         }
39     }
40     long long sum1 = 0, sum2 = 0;
41     map<int, int>::iterator it;
42     for(it=a.begin(); it!=a.end();++it)
43         sum1 += it->se, sum2 += it->fi;
44     printf("%lld %lld\n", sum1, sum2);
45 }

 1 //P2073 送花
 2 #include<iostream>
 3 #include<cstdio>
 4 #include<algorithm>
 5 #include<queue>
 6 using namespace std;
 7
 8 const int MAXN = 1000000 + 1;
 9
10 int vis[MAXN];
11 priority_queue<int, vector<int>, greater<int> > q1;
12 priority_queue<int> q2;
13
14 int main() {
15     int fl, w, c;
16     long long sum1 = 0, sum2 = 0;
17     while(scanf("%d", &fl) == 1 && fl != -1) {
18         if(fl == 1) {
19             scanf("%d%d", &w, &c);
20             if(vis[c]) continue;
21             q1.push(c), q2.push(c);
22             vis[c] = w;
23             sum1 += w, sum2 += c;
24         }
25         if(fl == 2) {
26             while(!q2.empty() && !vis[q2.top()]) q2.pop();
27             if(q2.empty()) continue;
28             int t = q2.top();
29             sum1 -= vis[t];
30             sum2 -= t;
31             vis[t] = 0;
32             q2.pop();
33         }
34         if(fl == 3) {
35             while(!q1.empty() && !vis[q1.top()]) q1.pop();
36             if(q1.empty()) continue;
37             int t = q1.top();
38             sum1 -= vis[t];
39             sum2 -= t;
40             vis[t] = 0;
41             q1.pop();
42         }
43     }
44     printf("%lld %lld\n", sum1, sum2);
45 }