九度OJ--大整數排序

搞了将近半個小時才搞定這道題，好久不練了，手生了。

#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
const int maxn=1000+12;


struct num{
    char name[maxn];
    int len;
};


num number[100+5];


int cmp(const void *a,const void *b)
{
    struct num *flag1=(num *)a;
    struct num *flag2=(num *)b;
    if(flag1->len!=flag2->len)return flag1->len-flag2->len;
    return strcmp(flag1->name,flag2->name);
}


int main()
{
    int n;
    while(scanf("%d",&n)!=EOF&&(n>=1&&n<=100))
    {
        for(int i=0;i<n;i++)
        {
            scanf("%s",number[i].name);
            number[i].len=strlen(number[i].name);
        }
        qsort(number,n,sizeof(num),cmp);
        for(int i=0;i<n;i++)
        printf("%s\n",number[i].name);
        //system("pause");
    }
    return 0;
}