摘要：View Code 1 #include<iostream> 2 #include<cstdio> 3 #include<queue> 4 using namespace std; 5 priority_queue <int ,vector<int>,greater<int> > q; 6 int main() 7 { 8 int t,n,x,y,sum; 9 int i;10 scanf("%d",&t);11 while(t--)12 {13 while(!q.empty())q.pop() 阅读全文