Pearls (P1260)

自己想的，自己写的未成功。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<cmath>
#include<set>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<string>

using namespace std;

int n;

struct my
{
	int num;
	int v;
	bool operator<(my b)

	{
		return v<b.v;
	}
}
go[1111];

int sum[1111];
int dp[1111];

int main()
{
	freopen("in.txt","r",stdin);
	int i,j,k;
	int cas;
	cin>>cas;
	while (cas--)
	{
		sum[0]=0;
		cin>>n;
		for (i=0;i<n;i++)
			cin>>go[i].num>>go[i].v,sum[i]=sum[i-1]+go[i].num;
		sort(go,go+n);

		for (i=0;i<n-1;i++)
		{
			if ((10+go[i].num)*go[i].v+(10+go[i+1].num)*go[i+1].v>=(10+go[i].num+go[i+1].num)*go[i+1].v)
			{
				go[i+1].num+=go[i].num;
				go[i].num=0;
			}
		}


		int ans=0;
		for (i=0;i<n;i++)
		{
			if (go[i].num)
			{
				ans+=(go[i].num+10)*go[i].v;
			}
		}
		cout<<ans<<endl;

	}

	return 0;
}

这样就成功了，不过个人觉得这两种方法差不多的啊，

#include<iostream>  
using namespace std;  
  
int min(int a,int b)  
{  
    return a<b?a:b;  
}  
  
int main(int i,int j)  
{  
    int test;  
    cin>>test;  
    while(test--)  
    {  
        /*Input & Initial*/  
  
        int c;  
        cin>>c;  
  
        int* a=new int[c+1];  //某类珍珠数目  
        int* p=new int[c+1];  //某类珍珠单价  
        int* dp=new int[c+1]; //dp[i]表示在已知第i类珍珠时,所需支付的最低价格  
        int* sum=new int[c+1];//sum[i]=∑a[i]  
  
        sum[0]=0;  
        for(i=1;i<=c;i++)  
        {  
            cin>>a[i]>>p[i];  
            sum[i]=sum[i-1]+a[i];  
        }  
  
        /*Dp*/  
  
        dp[0]=0;  //Dp初始化  
        for(i=1;i<=c;i++)  
        {  
            dp[i]=(a[i]+10)*p[i]+dp[i-1];   //当第i种珍珠出现时，未优化价格的情况  
            for(j=0;j<i;j++)  //枚举第i种珍珠前的每一种珍珠，寻找最优价格  
                dp[i]=min(dp[i],dp[j]+(sum[i]-sum[j]+10)*p[i]);  //在求dp[i]前，对于每一个j<i，dp[j]的最优值已求出  
        }                                                        //(sum[i]-sum[j]+10)*p[i]即第j+1~i种珍珠被第i种珍珠替代后的价格  
        cout<<dp[c]<<endl;  
  
        delete a,p,dp,sum;  
    }  
    return 0;  
}  

Pearls

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 5654		Accepted: 2705

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.

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.

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

330
1344