Digging dp

When it comes to the Maya Civilization, we can quickly remind of a term called the end of the world. It's not difficult to understand why we choose to believe the prophecy (or we just assume it is true to entertain ourselves) if you know the other prophecies appeared in the Maya Calendar. For instance, it has accurately predicted a solar eclipse on July 22, 2009.

The ancient civilization, such as Old Babylonianhas, Ancient Egypt and etc, some features in common. One of them is the tomb because of the influence of the religion. At that time, the symbol of the tomb is the pyramid. Many of these structures featured a top platform upon which a smaller dedicatory building was constructed, associated with a particular Maya deity. Maya pyramid-like structures were also erected to serve as a place of interment for powerful rulers.

Now there are N coffin chambers in the pyramid waiting for building and the ruler has recruited some workers to work for T days. It takes ti days to complete the ith coffin chamber. The size of the ith coffin chamber is si. They use a very special method to calculate the reward for workers. If starting to build the ith coffin chamber when there are t days left, they can get t*si units of gold. If they have finished a coffin chamber, then they can choose another coffin chamber to build (if they decide to build the ith coffin chamber at the time t, then they can decide next coffin chamber at the time t-ti).

At the beginning, there are T days left. If they start the last work at the time t and the finishing time t-ti < 0, they will not get the last pay.

Input

There are few test cases.

The first line contains N, T (1 ≤ N ≤ 3000,1 ≤ T ≤ 10000), indicating there are N coffin chambers to be built, and there are T days for workers working. Next N lines contains ti, si (1 ≤ ti, si ≤ 500).

All numbers are integers and the answer will not exceed 2^31-1.

Output

For each test case, output an integer in a single line indicating the maxminal units of gold the workers will get.

Sample Input

3 10
3 4
1 2
2 1

Sample Output

62

Hint

Start the second task at the time 10
Start the first task at the time 9
Start the third task at the time 6
The answer is 10*2+9*4+6*1=62

code：

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<math.h>
#include<string.h>
using namespace std;
const double eps=1e-5;
/*
递推公式：
==max(dp[j],dp[j-node[i].t]+node[i].s*(T-j+node[i].t));
*/
struct Node
{
    int t,s;
    double val;
} node[3100];

int dp[11100];
bool cmp(Node a,Node b)//这样排序之后能过样例
{
    if(fabs(a.val-b.val)<eps)
    //if(a.s==b.s)//这里就是做实验的<img alt="委屈" src="http://static.blog.csdn.net/xheditor/xheditor_emot/default/wronged.gif" />
        return a.t<b.t;
       // return a.s>b.s;//还有这里
    return a.val<b.val;
}
int main()
{
    //freopen("i.txt","r",stdin);
    int i,j,N,T,ans;
    while(scanf("%d%d",&N,&T)!=EOF)
    {
        memset(dp,0,sizeof(dp));
        for(i=1; i<=N; i++)
        {
            scanf("%d%d",&node[i].t,&node[i].s);
            node[i].val=(node[i].t*1.0)/node[i].s;
        }
        sort(node+1,node+N+1,cmp);

        ans=0;
        for(i=1; i<=N; i++)
        {
            for(j=T; j>=node[i].t; j--)
            {
                dp[j]=max(dp[j],dp[j-node[i].t]+node[i].s*(T-j+node[i].t));
                ans=max(ans,dp[j]);
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}