HDOJ 1590

#include<stdio.h>
#include<iostream>
#include<stdlib.h>
#include<string.h>
using namespace std;

typedef struct minheap *Heap;
struct minheap
{
    int last,max;
    int data[60001];
    char str[60001][100];
    int para[6001];
}Minheap;

void HeapInset(int x,Heap H,char s[],int pa)
{
    int i;
    
    i=++H->last;
    while(i!=1&&x<H->data[i/2])
    {
        H->data[i]=H->data[i/2];
        strcpy(H->str[i],H->str[i/2]);
        H->para[i]=H->para[i/2];
        i/=2;
    }
    H->data[i]=x;
    strcpy(H->str[i],s);
    H->para[i]=pa;    
}


int deleMin(Heap H)
{
    int i,ci;
    int x,y;
    char str[110];
    int pa;
    x=H->data[1];//堆中最小元
    
    
    strcpy(str,H->str[H->last]);
    pa=H->para[H->last];
    y=H->data[H->last];
    
    H->last--;
    
    i=1;
    ci=2;
    //cout<<"last="<<H->last<<endl;
    while(ci<=H->last)
    {
        //cout<<"ci="<<ci<<"y="<<y<<endl<<" "<<H->data[ci]<<endl;
        if(ci<H->last&&H->data[ci+1]<H->data[ci])ci++;
        if(H->data[ci]>y)break;

        
        H->data[i]=H->data[ci];
        strcpy(H->str[i],H->str[ci]);
        H->para[i]=H->para[ci];
        
        i=ci;
        ci*=2;
    }
    
    H->data[i]=y;
    strcpy(H->str[i],str);
    H->para[i]=pa;
    int tmp;
    if(H->data[i]==H->data[i+1])
    {
        tmp=H->data[i];H->data[i]=H->data[i+1];H->data[i+1]=tmp;
        tmp=H->para[i];H->para[i]=H->para[i+1];H->para[i+1]=tmp;
        strcpy(str,H->str[i]);strcpy(H->str[i],H->str[i+1]);
        strcpy(H->str[i+1],str);
    }
    
    return x;
}
int main()
{
    char str[100],s1[100];
    int para,data;
    Heap H;
    H=(Heap)malloc(sizeof(Minheap));
    H->last=0;
    H->max=61234;
    while(cin>>s1)
    {
        
        if(s1[0]=='P')
        {
            cin>>str>>para>>data;
            HeapInset(data,H,str,para);
            
            //cout<<"insert: "<<str<<" "<<para<<" "<<data<<endl;
            
            //cout<<"text:"<<H->str[1]<<" "<<H->data[1]<<endl;
        }
        else if(s1[0]=='G')
        {
            if(H->last==0)
                printf("EMPTY QUEUE!
");
            else 
            {
                cout<<H->str[1]<<" "<<H->para[1]<<endl;
                
                deleMin(H);
                //cout<<"last:"<<H->str[H->last]<<" "<<H->data[H->last]<<endl;
                //cout<<"last-1:"<<H->str[H->last-1]<<" "<<H->data[H->last-1]<<endl;
            }
            
        }
        //cout<<H->last<<endl;    
    }
    return 0;    
}

一直WA~最小堆。应该是相同的优先级的时候，按照输入顺序输出