hdu 2831

#include<stdio.h>
#include<stdlib.h>
struct node{
int x,y,j,num;
}a[110];
int cmp(const void *b,const void *c) {
return (*(struct node *)b).num -(*(struct node *)c).num ;
}
int main() {
int n,m,i,j,k,c[110];
while(scanf("%d%d",&n,&m)!=EOF) {
int flag=0;
for(i=0;i<n;i++) {
scanf("%d%d",&a[i].x,&a[i].y);
a[i].num=a[i].x-a[i].y-m;
a[i].j=i+1;
}
qsort(a,n,sizeof(a[0]),cmp);
flag=m;k=0;
for(i=0;i<n;i++) {
if(a[i].y+m<=a[i].x) {
m=m+flag;
c[k++]=a[i].j;
}
else
break;
}
if(i!=n) {
printf("The zombies eat your brains! ");
continue;
}
else {
printf("%d",c[0]);
for(i=1;i<k;i++)
printf(" %d",c[i]);
printf(" ");
}
}
return 0;
}