1845282_ac_15ms_36k.c

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

# include <stdio.h>
# include <stdlib.h>
int cmp( const void *a , const void *b ) 
{ 
    return *(double *)a > *(double *)b ? 1 : -1; 
}
void main()
{
    int K, i, flag;
    double a[20], sum;

    while(scanf("%d",&K)==1&&K)
  {
        for(i = 0; i < K; i++) scanf("%lf",&a[i]);
        if(K == 1) printf("NO\n");
          else if(K == 2)
              {
                if(a[0]==a[1])
                  printf("YES\n");
                else 
                  printf("NO\n");
              }
              else
              {
                flag = 0;
                qsort(a,K,sizeof(a[0]),cmp);
                sum=a[0]+a[1];
                for(i = 2;i < K; i++)
               {
                if(sum>=a[i])
                 {
                    flag = 1;
                    printf("YES\n"); break;
                 }
                else sum += a[i];
               }
            if(!flag) printf("NO\n");
        }
    }
}