Mixing Milk

英文题目描述：

Since milk packaging is such a low margin business, it is important to keep the price of the raw product (milk) as low as possible. Help Merry Milk Makers get the milk they need in the cheapest possible manner.

The Merry Milk Makers company has several farmers from which they may buy milk, and each one has a (potentially) different price at which they sell to the milk packing plant. Moreover, as a cow can only produce so much milk a day, the farmers only have so much milk to sell per day. Each day, Merry Milk Makers can purchase an integral amount of milk from each farmer, less than or equal to the farmer's limit.

Given the Merry Milk Makers' daily requirement of milk, along with the cost per gallon and amount of available milk for each farmer, calculate the minimum amount of money that it takes to fulfill the Merry Milk Makers' requirements.

Note: The total milk produced per day by the farmers will be sufficient to meet the demands of the Merry Milk Makers.

Input

The first line contains two integers, N and M. The first value, N, (0 <= N <= 2,000,000) is the amount of milk that Merry Milk Makers' want per day. The second, M, (0 <= M <= 5,000) is the number of farmers that they may buy from.

The next M lines (Line 2 through M+1) each contain two integers, Pi and Ai. Pi (0 <= Pi <= 1,000) is price in cents that farmer i charges. Ai (0 <= Ai <= 2,000,000) is the amount of milk that farmer i can sell to Merry Milk Makers per day.

Output

A single line with a single integer that is the minimum price that Merry Milk Makers can get their milk at for one day.

c语言实现：

#include <stdio.h>
#include <math.h>

typedef struct
{
    int price;
    int num;
}Milk;
void quick_sort(Milk milk[], int l, int r);
int main(void)
{
    int n , m;
    while(scanf("%d %d",&n,&m)!= EOF)
    {
        int sum = 0,min = 0;
        Milk milk[m];
        int i = 0;
        while(i<m)
        {
          scanf("%d %d",&milk[i].price,&milk[i].num);
          i++;
        }

        quick_sort(milk,0,m-1);
        i = -1;
        while(sum <= n)
        {
            i++;
            sum+=milk[i].num;
            if(sum <= n)
            {
                min+=milk[i].num *milk[i].price;
            }
        }
        if(sum>n)
        min+=(milk[i].num-(sum-n))*milk[i].price;
        printf("%d\n",min);
    }
    return 0;
}
void quick_sort(Milk milk[], int l, int r)
{
    if (l < r)
    {

        int i = l, j = r;
        Milk x = milk[l];
        while (i < j)
        {
            while(i < j && milk[j].price >= x.price)
               j--;
            if(i < j)
               milk[i++] = milk[j];

            while(i < j && milk[i].price < x.price)
                i++;
            if(i < j)
                milk[j--] = milk[i];
        }
        milk[i] = x;
        quick_sort(milk, l, i - 1);
        quick_sort(milk, i + 1, r);
    }
}

思路：思路很重要，本题主要是建立结构体，对价格进行排序。按照贪心法则，先买价格便宜的牛奶。即贪心法则取得最小值。