7-19 Windows消息队列

#include
#include
#include
using namespace std;
int n,y;
struct ele{
	string s;
	int x;
	bool operator<(const ele &a)const{
		return x>a.x;
	}
};
int main()
{
	cin>>n;
	string s1,s2;
	priority_queueq;
	for(int i=1;i<=n;i++)
	{
		cin>>s1;
		if(s1=="PUT")
		{
			cin>>s2>>y;
			q.push({s2,y});
		}
		else{
			if(!q.empty())
			{
				ele e=q.top();
				q.pop();
				cout<					
										


					

						
欢迎分享，转载请注明来源：内存溢出
原文地址: http://outofmemory.cn/zaji/5691645.html