zoukankan      html  css  js  c++  java
  • zoj 2724

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <queue>
    #include <vector>

    using namespace std;

    struct node{
    char msg[20];
    int a,b;
    };
    struct cmp{
    bool operator()(const node x, const node y)
    {
    return x.b > y.b;
    }
    };
    int main(int argc,char * argv[])
    {
    freopen("aaa.txt","r",stdin);
    char s[100];
    char order[10];
    priority_queue<node,vector<node>,cmp> q;
    while(gets(s))
    {
    if(strlen(s) == 0)
    break;
    sscanf(s,"%s",order);
    if(strcmp(s,"GET")==0)
    {
    if(q.empty())
    fprintf(stdout,"EMPTY QUEUE! ");
    else
    {
    fprintf(stdout,"%s %d ",q.top().msg,q.top().a);
    q.pop();
    }
    }
    else
    {
    node n;
    sscanf(s,"%s %s %d %d",order,n.msg,&n.a,&n.b);
    q.push(n);
    }
    }
    return 0;
    }

    珑嫙(295775492) 11:15:36

    //2724

    #include <iostream>
    #include<queue>
    #include<cstring>
    using namespace std;
    struct node
    { char x[10];
    int a,b;
    const bool operator<(const node &y)const
    { if(b==y.b)return a>y.a;
    return b > y.b;
    }

    }s;
    priority_queue<node>my;
    int main()
    {
    char c[3];
    int i,j=0;
    while(cin>>c)
    {
    if(c[0]!='G')
    {
    cin>>s.x>>s.a>>s.b;
    my.push(s);
    }
    else
    {
    if(my.empty())
    cout<<"EMPTY QUEUE!"<<endl;
    else
    {
    cout<<my.top().x<<" "<<my.top().a<<endl;
    my.pop();
    }
    }
    }
    return 0;
    }

  • 相关阅读:
    hdu 3268 09 宁波 现场 I
    hdu 3697 10 福州 现场 H
    CodeForces Round #521 (Div.3) D. Cutting Out
    #Leetcode# 226. Invert Binary Tree
    zufe 蓝桥选拔
    #Leetcode# 100. Same Tree
    #Leetcode# 6. ZigZag Conversion
    PAT 1084 外观数列
    #Leetcode# 38. Count and Say
    #Leetcode# 22. Generate Parentheses
  • 原文地址:https://www.cnblogs.com/2014acm/p/3903239.html
Copyright © 2011-2022 走看看