1836951_ac_281ms_24k.c

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

# include <stdio.h>

void main()
{
 int n, i, N, j, p, t, k, s[1001];
 long stamps, sum;
 
 scanf("%d",&n);
 for(i = 1; i <= n; i++)
 {
  scanf("%ld%d",&stamps,&N);
  for(j = 0; j < N; j++)
  scanf("%d",&s[j]);
  for(j = 0; j < N - 1; j++)
  {
    p = j;
    for(k = j + 1; k < N; k++)
     if(s[p] < s[k]) 
      p = k;
     if(p != j)
     {
      t = s[p];
      s[p] = s[j];
      s[j] = t;
     }
  }
  sum = 0;
  for(j = 0; j < N; j++)
   {
    sum += s[j];
    if(sum >= stamps)
    break;
   }
   printf("Scenario #%d:\n",i);
   if(sum >= stamps) printf("%d\n\n",j+1);
   else printf("impossible\n\n");
 }
}