CodeForces - 799B-T-shirt buying （优先队列）

题目链接

 /*
     Name:
     Copyright:
     Author:
     Date: 2018/5/2 16:09:54
     Description:优先队列
 */
 #include <iostream>
 #include <cstdio>
 #include <vector>
 #include <cstring>
 #include <queue>
 using namespace std;
 const int MAXN = ;
 int price[MAXN];
 struct tshirt{
     int index, pri;
     tshirt(int i){
         this->index = i;
         this->pri = price[i] ;
     };
     bool operator <(const tshirt& lpm) const {
         return pri > lpm.pri;
     }
 };
 int main()
 {
     int n;
     while (scanf("%d", &n) != EOF) {
         priority_queue<tshirt> lev[];
         memset(price, , sizeof(price));
         for (int i=; i<n; i++)
             scanf("%d", &price[i]);
         int level;
         for (int i=; i<n; i++) {
             scanf("%d", &level);
             tshirt demo(i);
             lev[level].push(demo);
         }
         for (int i=; i<n; i++) {
             scanf("%d", &level);
             tshirt demo(i);
             lev[level].push(demo);
         }
         int num, fav;
         scanf("%d", &num);
         for (int i=; i<num; i++) {
             scanf("%d", &fav);
             if (lev[fav].empty() ){
                 cout<<-<<" ";
                 continue;
             }
             int value = ;
             while (!lev[fav].empty() && !value) {
                 if (price[lev[fav].top().index] == -) {//去掉重复的
                     lev[fav].pop();
                 } else {
                     value = ;
                     cout<<lev[fav].top().pri<<" ";
                     price[lev[fav].top().index] = -;
                     lev[fav].pop();
                 }
             }
             if (!value){
                 cout<<-<<" ";
             }
         }
         cout<<endl;
     }
     return ;
 }