ACM-Saving HDU

网上的例程

#include<iostream>

#include<algorithm>

using namespace std;

struct TS

{

         int pi;  //单位体积的价值

         int mi; //总有体积

};

bool cmp(TS a,TS b)

{

         return a.pi>b.pi;

}

int main()

{

         int v,n,Sum,flag;

         TS b[110];

         while(scanf("%d",&v)&&v!=0)

         {

                scanf("%d",&n);

                for(int i=0;i<n;i++)

                scanf("%d%d",&b[i].pi,&b[i].mi);

                sort(b,b+n,cmp);    //排序从大到小

                flag=1;

                for(i=0,Sum=0;i<n&&flag;i++)

                {

                       for(int j=1;j<=b[i].mi;j++)//物品的体积，                   

                       {

                              v-=1;                     //一体积一体积的取,直到为零

                              Sum+=b[i].pi;

                              if(v==0)                //袋子装满，退出

                              {

                                     flag=0;

                                     break;

                               }

                       }

                }

               printf("%d\n",Sum);

         }

        return 0;

}

我自己写的

#include<iostream>
#include<algorithm>
using namespace std;


struct stu
{  int pi,mi;
};


bool cmp(stu a1,stu a2)
{
   return a1.pi>a2.pi; 
}


int main()
{  int v,n,b,i;
   stu a[101];
   while (scanf("%d",&v) && v != 0)
   { cin>>n;
     for( i=1;i<=n;i++)
{
  cin>>a[i].pi>>a[i].mi;
}
     sort(a+1,a+1+n,cmp);
     i=1;
b=0;
     
while (v>0 &&i <=n)
{ 
  if (v>a[i].mi)
  {
  b=b+a[i].mi*a[i].pi;
  v=v-a[i].mi;
  }
  else { b=b+a[i].pi*v; v=0;}
  
  i++;
   }
   cout<<b;
   cout<<'\n';
   }
return 0;
}
   cout<<b;
   cout<<'\n';
   }
return 0;
}