Mix Milk

前两天我的csdn博客崩溃了，25号收到了webmaster的来信，说已经OK了，现在果然可以了，(*^__^*) 嘻嘻……

回家的这两天一直没上网，家里没网，现在是在二姑的办公实里。平邑二中上网居然也要实名制了，不屑……关公面前刷大刀！

Mix Milk

非常简单的一道题：

//是个英文题…… /* Mixing MilkSince 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. Sample Input 100 5 5 20 9 40 3 10 8 80 6 30 Sample Output 630 */ //看完题我都惊了，太简单了吧，遍历求最小…… //只是不明白pi是farmer i牛奶的单价还是总价钱，应该是单价吧 #include "stdafx.h" #include <iostream> using namespace std; typedef struct sellers { int dwPi; int dwAi; }Seller; typedef struct linker { Seller dwSeller; struct linker* lpNext; }Linker,*pLinker; int main() { int dwCounterYesNo = 0; int dwSmallerMoney = 0; cout<<"请输入："<<endl; int dwN,dwM; cin>>dwN>>dwM; Linker* lpLinker = (Linker *)malloc(dwM * sizeof(Linker)); Linker* lpLinkerCopy = lpLinker; Linker* lpLinkerRecord = lpLinker; for (int dwCounter = 0;dwCounter < dwM;lpLinkerCopy++,dwCounter++) { cin>>lpLinkerCopy->dwSeller.dwPi>>lpLinkerCopy->dwSeller.dwAi; lpLinkerCopy->lpNext = lpLinkerCopy + 1; } lpLinkerCopy--; lpLinkerCopy->lpNext = lpLinker; Seller dwSellerMin; do{ dwCounterYesNo = 0; lpLinkerCopy = lpLinker; dwM--; dwSellerMin.dwAi = lpLinker->dwSeller.dwAi; dwSellerMin.dwPi = lpLinker->dwSeller.dwPi; for (int dwCounter = 0;dwCounter <= dwM;lpLinkerCopy = lpLinkerCopy->lpNext,dwCounter++) { if (dwSellerMin.dwPi > lpLinkerCopy->dwSeller.dwPi) { lpLinkerCopy--; lpLinkerRecord = lpLinkerCopy; lpLinkerCopy++; dwCounterYesNo++; dwSellerMin = lpLinkerCopy->dwSeller; } } if (dwCounterYesNo == 0) { lpLinkerRecord = lpLinkerCopy; lpLinker = lpLinker->lpNext; } lpLinkerRecord->lpNext = lpLinkerRecord->lpNext->lpNext; dwN -= dwSellerMin.dwAi; if (dwN > 0) dwSmallerMoney += dwSellerMin.dwPi * dwSellerMin.dwAi; else{ dwSmallerMoney += dwSellerMin.dwPi * (dwSellerMin.dwAi+dwN); break; } }while(1); cout<<dwSmallerMoney<<endl; free(lpLinker); system("pause"); return 0; }

very easy，不做过多的评论……

不过除了上述的做法之外有一个非常简单的算法，但要牺牲一些空间。

Pi (0 <= Pi <= 1,000)

看上面的条件，既然Pi价格有限制，那么我们就开辟一个1000大小的数组，保证每种价钱都能有一个对应。

接收用户输入的时候，把相应的价钱对应相应的数组下标。比如，我的牛奶1Gallon10美金，那么我在鼠标下标为10的地方放入他的牛奶的数量。这样的话，当取牛奶的时候呢，从0（没有免费的牛奶的话就是1咯）开始拿牛奶，拿到够数为之。这种做法是非常快的。

代码很简单，没写。