Codeforces Valera and Fruits

最新推荐文章于 2017-01-20 16:11:52 发布

zthgreat

最新推荐文章于 2017-01-20 16:11:52 发布

阅读量606

点赞数

分类专栏：【基础题】

本文链接：https://blog.csdn.net/u014634338/article/details/38456811

版权

【基础题】专栏收录该内容

175 篇文章 1 订阅

订阅专栏

Valera and Fruits

Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status

Description

Valera loves his garden, where n fruit trees grow.

This year he will enjoy a great harvest! On the i-th tree b_i fruit grow, they will ripen on a day number a_i. Unfortunately, the fruit on the tree get withered, so they can only be collected on day a_i and day a_i + 1 (all fruits that are not collected in these two days, become unfit to eat).

Valera is not very fast, but there are some positive points. Valera is ready to work every day. In one day, Valera can collect no more thanv fruits. The fruits may be either from the same tree, or from different ones. What is the maximum amount of fruit Valera can collect for all time, if he operates optimally well?

Input

The first line contains two space-separated integers n and v(1 ≤ n, v ≤ 3000) — the number of fruit trees in the garden and the number of fruits that Valera can collect in a day.

Next n lines contain the description of trees in the garden. The i-th line contains two space-separated integers a_i and b_i(1 ≤ a_i, b_i ≤ 3000) — the day the fruits ripen on the i-th tree and the number of fruits on the i-th tree.

Output

Print a single integer — the maximum number of fruit that Valera can collect.

Sample Input

Input

2 3
1 5
2 3

Output

Input

Output

Hint

In the first sample, in order to obtain the optimal answer, you should act as follows.

On the first day collect 3 fruits from the 1-st tree.
On the second day collect 1 fruit from the 2-nd tree and 2 fruits from the 1-st tree.
On the third day collect the remaining fruits from the 2-nd tree.

In the second sample, you can only collect 60 fruits, the remaining fruit will simply wither.

//真心不是自己做出来的，太悲剧了，自己开始做得很复杂，而且有一大堆问题要解决，越写越麻烦，看了网上别个的解答过后，真的觉得妙呀，简直不是一个档次的

#include <iostream>
using namespace std;
int main()
{
    int n,v,a,b,m;
    int num[3002]={0};
    while (cin>>n>>v)
    {
        m=0;
        for (int i=0; i<n; i++)
        {
            cin>>a>>b;
            num[a]+=b;   //同时成熟的合并
        }
        for (int i=1; i<=3001; i++)  //这里需要3001及以上，那不然3000这个数据会不对的，测试过得，（原因在于还可以有一天可以摘，而没有计算）
        {
            if(num[i]+num[i-1]<=v)    //连续连个进行判断
            {
                m+=num[i]+num[i-1];
                num[i]=num[i-1]=0;   //摘完了
            }
            else
            {
                m+=v;
                if(num[i-1]>=v)
                {
                    num[i-1]-=v;  //i-1天成熟这颗摘不完
                }
                else
                {
                    num[i]=num[i]+num[i-1]-v;  //i天成熟这颗摘不完，相当于放到第i天成熟的树上，还可以摘一次
                }
            }
        }
        cout<<m<<endl;
    }
    return 0;
}