HDU-1009 贪心算法

HDU-1009

FatMouse’ Trade
添加链接描述

#include<stdio.h>
int main (void)
{
    int n,i,j;
    double ml,t1,t2,t3,a[1000],b[1000],k[1000],javabean;
    while(~scanf("%lf %d",&ml,&n)&&(ml!=-1&&n!=-1)){
        javabean=0.0;
        for(i=0;i<n;i++){
            scanf("%lf %lf",&a[i],&b[i]);
            k[i]=a[i]/b[i]*1.0;
            for(j=0;j<i;j++){
                if(k[i]>k[j]){
                    t1=k[i];
                    k[i]=k[j];
                    k[j]=t1;
                    t2=a[i];
                    a[i]=a[j];
                    a[j]=t2;
                    t3=b[i];
                    b[i]=b[j];
                    b[j]=t3;
                }
            }
        }
        for(i=0;i<n;i++){
        	if(ml>b[i]){
        		javabean+=a[i];
        		ml-=b[i];
			}
			else{
				javabean+=1.0*k[i]*ml;
				break;
			}
		}
        printf("%.3f\n",javabean);
    }
    return 0;
}