hdu-2187

悼念512汶川大地震遇难同胞——老人是真饿了

http://acm.hdu.edu.cn/showproblem.php?pid=2187

一般算法

#include<stdio.h>
int main()
{
    int T;
    int m,i,j;
    double per[1200],weight[1200],n;
    double k,t,sum;
    scanf("%d",&T);
    while(T--)
    {
      sum=0;
      scanf("%lf%d",&n,&m);          
      for(i=0;i<m;i++)
      scanf("%lf%lf",&per[i],&weight[i]);
      for(i=0;i<m;i++)
        for(j=i+1;j<m;j++)
        {
          if(per[i]>per[j])
          {
             t=per[i];per[i]=per[j];per[j]=t;
             k=weight[i];weight[i]=weight[j];weight[j]=k;         
          }                                    
        }
        for(i=0;i<m;i++)
        {
          if(n/per[i]>weight[i])
           sum+=weight[i];                 刚刚跟同学们考试的时候没做出来，怎么也没有思路，考试过后上网一看全是贪心算法，忽然觉得我跟同学们的差距在一点点的拉开
          else                                //         还好受点启发，自己用普通的方法把它给做出来了，不然就该丢人了。。。。
        {
          sum+=n/per[i];
          break;
        }
           if(n>0)
          n-=per[i]*weight[i];
        }
        printf("%.2lf\n",sum);
    }
return 0;   
}
贪心算法

#include<stdio.h>
#include<stdlib.h>
struct sum
{
  int price;
  int weight;  
}sum[1200];
int cmp(void const *a,void const *b)
{
   struct sum *price1=(struct sum *)a;    
   struct sum *price2=(struct sum *)b;
   return price1->price-price2->price;
}
int main()
{
   int m,i,j,a;
   double t,n;
   scanf("%d",&a);
   while(a--)
   {
     t=0.0;
     scanf("%lf%d",&n,&m);         
     for(i=0;i<m;i++)
       scanf("%d%d",&sum[i].price,&sum[i].weight);
       qsort(sum,m,sizeof(struct sum),cmp);
       for(i=0;i<m;i++)
       {
         if(n/(sum[i].price*1.0)>sum[i].weight)               
         {
            t+=sum[i].weight;
   //     n=n-sum[i].price*sum[i].weight;                                                       
         }
         else
         {
    //    if(n==0)
      //    break;
           t+=n/(sum[i].price*1.0);
           break;  
         }
         if(n>0)
         n=n-sum[i].price*sum[i].weight;      
       }
               printf("%.2lf\n",t);      
   }
return 0;   
}