/*
ID : cm750621
LANG : C++
TASK : milk
*/
#include<stdio.h>
#include<stdlib.h>
struct milk{
int pr;
int num;
};
struct milk a[5010];
int main(){
freopen("milk.in","r",stdin);
freopen("milk.out","w",stdout);
int i,j,k,m,n,l,cost=0,milkx=0,tmp,tnp;
scanf("%d%d",&m,&n);
if(m==0||n==0){
printf("0");
puts("");
return 0;
}
for(i=1;i<=n;i++)
scanf("%d%d",&a[i].pr,&a[i].num);
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(a[i].pr>a[j].pr){
tmp=a[i].pr;a[i].pr=a[j].pr;a[j].pr=tmp;
tnp=a[i].num;a[i].num=a[j].num;a[j].num=tnp;
}
for(i=1;i<=n;i++){
k=a[i].pr;
l=a[i].num;
j=milkx+l;
if(j>m){
cost+=(m-milkx)*k;
break;
}
milkx+=l;
cost+=k*l;
}
printf("%d",cost);
puts("");
return 0;
}
usaco 1.3.1 milk
最新推荐文章于 2024-05-10 21:22:09 发布