Description
In Pearlania everybody is fond of pearls. One company, called The Royal Pearl, produces a lot of jewelry with pearls in it. The Royal Pearl has its name because it delivers to the royal family of Pearlania. But it also produces bracelets and necklaces for ordinary people. Of course the quality of the pearls for these people is much lower then the quality of pearls for the royal family.In Pearlania pearls are separated into 100 different quality classes. A quality class is identified by the price for one single pearl in that quality class. This price is unique for that quality class and the price is always higher then the price for a pearl in a lower quality class.
Every month the stock manager of The Royal Pearl prepares a list with the number of pearls needed in each quality class. The pearls are bought on the local pearl market. Each quality class has its own price per pearl, but for every complete deal in a certain quality class one has to pay an extra amount of money equal to ten pearls in that class. This is to prevent tourists from buying just one pearl.
Also The Royal Pearl is suffering from the slow-down of the global economy. Therefore the company needs to be more efficient. The CFO (chief financial officer) has discovered that he can sometimes save money by buying pearls in a higher quality class than is actually needed.No customer will blame The Royal Pearl for putting better pearls in the bracelets, as long as the
prices remain the same.
For example 5 pearls are needed in the 10 Euro category and 100 pearls are needed in the 20 Euro category. That will normally cost: (5+10)*10+(100+10)*20 = 2350 Euro.Buying all 105 pearls in the 20 Euro category only costs: (5+100+10)*20 = 2300 Euro.
The problem is that it requires a lot of computing work before the CFO knows how many pearls can best be bought in a higher quality class. You are asked to help The Royal Pearl with a computer program.
Given a list with the number of pearls and the price per pearl in different quality classes, give the lowest possible price needed to buy everything on the list. Pearls can be bought in the requested,or in a higher quality class, but not in a lower one.
Every month the stock manager of The Royal Pearl prepares a list with the number of pearls needed in each quality class. The pearls are bought on the local pearl market. Each quality class has its own price per pearl, but for every complete deal in a certain quality class one has to pay an extra amount of money equal to ten pearls in that class. This is to prevent tourists from buying just one pearl.
Also The Royal Pearl is suffering from the slow-down of the global economy. Therefore the company needs to be more efficient. The CFO (chief financial officer) has discovered that he can sometimes save money by buying pearls in a higher quality class than is actually needed.No customer will blame The Royal Pearl for putting better pearls in the bracelets, as long as the
prices remain the same.
For example 5 pearls are needed in the 10 Euro category and 100 pearls are needed in the 20 Euro category. That will normally cost: (5+10)*10+(100+10)*20 = 2350 Euro.Buying all 105 pearls in the 20 Euro category only costs: (5+100+10)*20 = 2300 Euro.
The problem is that it requires a lot of computing work before the CFO knows how many pearls can best be bought in a higher quality class. You are asked to help The Royal Pearl with a computer program.
Given a list with the number of pearls and the price per pearl in different quality classes, give the lowest possible price needed to buy everything on the list. Pearls can be bought in the requested,or in a higher quality class, but not in a lower one.
Input
The first line of the input contains the number of test cases. Each test case starts with a line containing the number of categories c (1<=c<=100). Then, c lines follow, each with two numbers ai and pi. The first of these numbers is the number of pearls ai needed in a class (1 <= ai <= 1000).
The second number is the price per pearl pi in that class (1 <= pi <= 1000). The qualities of the classes (and so the prices) are given in ascending order. All numbers in the input are integers.
The second number is the price per pearl pi in that class (1 <= pi <= 1000). The qualities of the classes (and so the prices) are given in ascending order. All numbers in the input are integers.
Output
For each test case a single line containing a single number: the lowest possible price needed to buy everything on the list.
Sample Input
2 2 100 1 100 2 3 1 10 1 11 100 12
Sample Output
3301344
题意:每种珍珠的数量和价格都不相同,价格顺序有小到大给出,但是买每种珍珠都需要多买10个,价格低的可以在价格高的珍珠种类中买,如题中给的样例,买5个10元的和买100个20元的,单独买就需要(5+10)*10+(100+10)*20 = 2350,把10元的当成20元得买,需要(5+100+10)*20 = 2300 ,问买这些珍珠的最小花费是多少
其他针对代码解释
#include<stdio.h> #include<algorithm> #include<string.h> #define INF 0x3f3f3f3f using namespace std; int main() { int n,m,sum; int a[110],b[110]; int dp[110]; scanf("%d",&n); while(n--) { scanf("%d",&m); memset(a,0,sizeof(a)); memset(dp,0,sizeof(dp)); memset(b,0,sizeof(b)); for(int i=1; i<=m; i++) { scanf("%d%d",&a[i],&b[i]); a[i]+=a[i-1]; //都按该种价格买时的数量和 } for(int i=1; i<=m; i++) { int minn=INF; for(int j=0; j<i; j++) { sum=(a[i]-a[j]+10)*b[i]+dp[j];//枚举每种情况 //例如:dp[3]包括 1,2/3 1,3/2 1/2,3 1/2/3 1,2,3 (’/‘代表’/‘的前后分开买)这五种情况, //(1)a[3]-a[0]时,代表1,2,3,在一起买 //(2)a[3]-a[1]时,代表1,单独,2,3一起买 //(3)a[3]-a[2]时,代表3单独买 //然而3单独买的情况,加的是dp[2],其中dp[2]是已经算出的1,2单独买还是一起买的最小值,所以包含1/2/3 1,2/3两种 //并且3的价格最大,1,2一起买肯定要小于1,3一起买,所以间接又包含了1,3/2这种 minn=min(minn,sum); } dp[i]=minn; } printf("%d\n",dp[m]); } return 0; }