hdu 2600排序

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;char s[30];struct node{    int x;    int y;}a[105];int cmp(node a,node b){    return a.x<b.x;}int main(){    int n,p,q,b,c;    while(scanf("%d",&n)!=EOF)    {        scanf("%d%d",&p,&q);        for(int i=1;i<=n;i++)        {            scanf("%d%d",&a[i].x,&a[i].y);            gets(s);        }        sort(a+1,a+n+1,cmp);        int cnt=-16000000;        int m=a[1].y;        for(int i=2;i<=n;i++)        {            if(a[i].x>a[i-1].y+1)            {                cnt=a[i].x-1;                //PRintf("cnt=%d/n",cnt);            }            if(a[i].y>m)            m=a[i].y;        }        if(m<q)            printf("%d/n",q);        else if(cnt!=-16000000)        {                printf("%d/n",cnt);        }        else        {            printf("Badly!/n");        }    }    return 0;}