PAT(A) 1036

#include<stdio.h>
#include<stdlib.h> 
struct Heapstruct;  
typedef struct Heapstruct *PriorityQueue;  
#define MinData -1
struct Heapstruct{  
    int capacity;  
    int size;  
    struct grade *a;  
}; 
struct grade{
	int score;
	char gender;
	char name[11];
	char id[11];
};
PriorityQueue Initialize(int MaxElements){  
    PriorityQueue h;  
    h = (PriorityQueue)malloc(sizeof(struct Heapstruct));  
    if(h == NULL){  
        printf("Out of Space\n");  
        return NULL;  
    }  
    h->a = (struct grade *)malloc(sizeof(struct grade)*MaxElements);  
    if(h->a == NULL){  
        printf("Out of Space\n");  
        return NULL;  
    }  
    h->capacity = MaxElements;  
    h->size = 0;  
    h->a[0].score = MinData;  
    return h;  
}  
  
int IsEmpty(PriorityQueue h){  
    return h->size == 0;  
}  
  
int IsFULL(PriorityQueue h){  
    return h->size == h->capacity-1;  
}  
  
void Insert(struct grade x,PriorityQueue h,int flag){  
    int i;  
    if(IsFULL(h)){  
        printf("Priority queue is full\n");  
        return ;  
    }
    if(flag){  
    for(i = ++h->size;h->a[i/2].score>x.score;i = i/2)  
        h->a[i] = h->a[i/2];  
    h->a[i] = x;
    }
    else {
    	h->a[0].score = 101;
    	for(i = ++h->size;h->a[i/2].score<x.score;i = i/2)  
        h->a[i] = h->a[i/2];  
    h->a[i] = x;
    }
    }  

struct grade FindMin(PriorityQueue h){  
    if(IsEmpty(h)){  
        printf("Priority queue is empty\n");    
    }
	else  
    return h->a[1];  
}    
int main(){
	struct grade stu;
	PriorityQueue p1,p2;
	int n,i,flag,score;
	scanf("%d",&n);
	getchar();
	p1 = Initialize(n+1);
	p2 = Initialize(n+1);
	while(n--){
		scanf("%s %c %s %d",stu.name,&stu.gender,stu.id,&stu.score);

		//printf("%c\n",stu.gender);
		if(stu.gender == 'M')
			Insert(stu,p1,1);
		else Insert(stu,p2,0);
	}
	flag = 0;

	if(!IsEmpty(p2)){
		stu = FindMin(p2);
		printf("%s %s\n",stu.name,stu.id);
		score = stu.score;
	}
	else{
		flag = 1;
		printf("Absent\n");
	}
		if(!IsEmpty(p1)){
		stu = FindMin(p1);
		printf("%s %s\n",stu.name,stu.id);
		
	}
	else{
		flag = 1;
		printf("Absent\n");
	}
	if(flag)
		printf("NA\n");
	else 
		printf("%d\n",score - stu.score);
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值