版权声明:我的GitHub:https://github.com/617076674。真诚求星! https://blog.csdn.net/qq_41231926/article/details/84837884
我的数据结构与算法题目集代码仓:https://github.com/617076674/Data-structure-and-algorithm-topic-set
原题链接:https://pintia.cn/problem-sets/15/problems/841
题目描述:
知识点:优先队列
思路:优先队列
对于字符串的保存,需要用char型数组,用string会导致测试点2超时。
C++代码:
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
struct message{
char name[11];
int priority;
friend bool operator < (message m1, message m2){
return m2.priority < m1.priority;
}
};
int N;
priority_queue<message> pq;
int main(){
scanf("%d", &N);
char command[4], msg[11];
int priority;
for(int i = 0; i < N; i++){
scanf("%s", command);
if(command[1] == 'U'){
scanf("%s %d", msg, &priority);
message tempMessage;
strcpy(tempMessage.name, msg);
tempMessage.priority = priority;
pq.push(tempMessage);
}else if(command[1] == 'E'){
if(pq.size() == 0){
printf("EMPTY QUEUE!\n");
}else{
printf("%s\n", pq.top().name);
pq.pop();
}
}
}
return 0;
}
C++解题报告: