一道HOJ上的题--Mixing milk

• acm新手，这么简单一道题拖拖拉拉想了两天，刚刚终于AC了，下面是题目部分：

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.
- 我的思路就是定义一个milk结构体存入价格和数量，然后用sort根据价格排序，最后由价格由低到高取出并算出总最低价格。。。听起来很简单，奈何本人水平渣愣是卡了好久。下面贴出代码

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef struct
    {
        int price;
        int num;
        /* data */
    }Milk;

bool cmp(Milk A,Milk B)
{
    return A.price < B.price;
}

int main(){
    int n,m;

    while(scanf("%d %d",&n,&m)!=EOF)
    {
        Milk milk[m];
        int i=0;
        while(i<m)
        {
          scanf("%d %d",&milk[i].price,&milk[i].num);
          i++;
        }
        sort(milk,milk+m,cmp);
        int sum = 0;
         i = -1;
        while(sum <= n)
        {
            i++;
            sum+=milk[i].num;
        }
        int min=0;
        if(sum == n)
        {

            for(int a=0;a<=i;a++)
            {
                min += milk[a].price*milk[a].num;
            }
        }
        if(sum > n)
        {

            for(int a=0;a<i;a++)
            {
                min += milk[a].price*milk[a].num;
            }
            min+=milk[i].price*(sum-n);
        }
        printf("%d\n",min );
    }
}