1847059_ac_46ms_160k.c

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <stdlib.h>

typedef struct node
{
    int ID, Len;
    double f;
    double order;
}SONG;
SONG s[65536];
int N,P;
int cmp( const void *a ,const void *b) 
{ 
    return (*(SONG *)a).order < (*(SONG *)b).order ? -1 : 1; 
} 
int main()
{
    int i;
    while(scanf("%d",&N)!=EOF)
    {
        for(i=0;i<N;i++)
        { 
         scanf("%d%d%lf",&s[i].ID,&s[i].Len,&s[i].f);
         s[i].order=(double)s[i].Len/s[i].f;
        }
        qsort(s,N,sizeof(s[0]),cmp);
        scanf("%d",&P);
        printf("%d\n",s[P-1].ID);
    }
    return 0;
}