LJ_COME!!!!!

摘要： 贪心+优先队列#include <iostream> #include <cstdio> #include <vector> #include <queue> using namespace std; const int maxn=50; int h[maxn],n; int main() { int tot=0; while(cin>>n&&n) { tot++; int i; priority_queue<int> q1; priority_queue<int,vector<int>, 阅读全文