1 #include<iostream>
 2 #include<queue>
 3 #include<set>
 4 #include<vector>
 5 using namespace std;
 6
 7 void parse(vector<set<int> >&adj, unsigned int p=0)//十分巧妙地递归读入。
 8 {
 9     unsigned int x;
10     cin>>x;
11     if(p)
12     {
13         adj[p].insert(x);
14         adj[x].insert(p);
15     }
16     while(true)
17     {
18         char ch;
19         cin>>ch;
20         if(ch==')') break;
21         parse(adj, x);
22     }
23     return;
24 }
25
26 int main()
27 {
28     //freopen( "in.txt", "r", stdin );
29     //freopen( "out.txt", "w", stdout );
30     char ch;
31     while(cin>>ch)
32     {
33         vector<set<int> > adj(1024, set<int>());
34         parse(adj);
35         priority_queue<int, vector<int>, greater<int> >leafs;
36         int n = 0;
37         for(unsigned int i = 0; i<adj.size();i++)
38         if(adj[i].size())
39         {
40             n++;
41             if(adj[i].size()==1)
42             leafs.push(i);
43         }
44         for(int k=1; k<n; k++)
45         {
46             unsigned int x = leafs.top();
47             leafs.pop();
48             unsigned int p = *(adj[x].begin());
49             if(k>1)
50             cout<<" ";
51             cout<<p;
52             adj[p].erase(x);
53             if(adj[p].size()==1)
54             leafs.push(p);
55         }
56         cout<<endl;
57     }
58     return 0;
59 }

#include<algorithm>
#include<vector>
#include<queue>
#include<cstdio>
#include<iostream>
using namespace std;int main()
{int n, k;while(~scanf("%d%d", &n, &k)){priority_queue<int, vector<int>, greater<int> >que;while(n--){char op[5];scanf("%s", op);if(op[0]=='I'){int val;scanf("%d", &val);que.push(val);while(que.size()>k) que.pop();}else printf("%d\n", que.top());}}return 0;
}

#include<algorithm>
#include<vector>
#include<queue>
#include<cstdio>
#include<iostream>
using namespace std;struct Cmp{bool operator()(const int&t1, const int&t2){return t1>t2;}};int main()
{int n, k;while(~scanf("%d%d", &n, &k)){priority_queue<int, vector<int>,Cmp>que;while(n--){char op[5];scanf("%s", op);if(op[0]=='I'){int val;scanf("%d", &val);que.push(val);while(que.size()>k) que.pop();}else printf("%d\n", que.top());}}return 0;
}

#include<algorithm>
#include<vector>
#include<queue>
#include<cstdio>
#include<iostream>
using namespace std;struct Cmp{bool operator()(const int&t1, const int&t2){return t1>t2;}};int main()
{int n, k;while(~scanf("%d%d", &n, &k)){priority_queue<int, vector<int>,Cmp>que;int t = k;char op[5];int val;while(t--){scanf("%s", &op);scanf("%d", &val);que.push(val);}n = n-k;while(n--){scanf("%s", &op);if(op[0]=='I'){scanf("%d", &val);if(val>que.top())que.push(val), que.pop();}else printf("%d\n", que.top());}}return 0;
}

#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;struct Node{int F;int index;friend bool operator<(Node a, Node b){if(a.F!=b.F) return a.F<b.F;else return a.index>b.index;}
};priority_queue<Node>q[110];
int main()
{int T;int kase, n, S;Node a;scanf("%d", &T);for(kase=1; kase<=T; kase++){scanf("%d", &n);for(int i=1; i<=n; i++){scanf("%d%d", &a.F, &S);a.index = i;q[S].push(a);}printf("Case #%d:\n", kase);for(int i=0; i<n; i++){int fast = -1, id = 1;for(int j=1; j<=100; j++)if(!q[j].empty()){Node tmp=q[j].top();if(tmp.F+i*j>fast) fast=tmp.F+i*j, id=j;else if(tmp.F+i*j==fast&&tmp.index<q[id].top().index) id = j;}printf("%d", q[id].top().index);q[id].pop();if(i<n-1)printf(" ");else printf("\n");}}return 0;
}