Codeforces441B_Valera and Fruits(暴力)

Valera and Fruits

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Valera loves his garden, where n fruit trees grow.

This year he will enjoy a great harvest! On the i-th tree bi fruit grow, they will ripen on a day number ai. Unfortunately, the fruit on the tree get withered, so they can only be collected on day ai and day ai + 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 ai and bi (1 ≤ ai, bi ≤ 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 test(s)

input

2 3
1 5
2 3

output

8

input

5 10
3 20
2 20
1 20
4 20
5 20

output

60

Note

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>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>

using namespace std;
int n,v;
struct node
{
    int t,d;
} num[10000];
int cmp(node a,node b)
{
    return a.t<b.t;
}
int main()
{
    int i,j;
    while(cin>>n>>v)
    {
        int sum=0;
        for(i=0; i<n; i++)
            cin>>num[i].t>>num[i].d;
        sort(num,num+n,cmp);
        for(i=1; i<=3001; i++)
        {
            int vv=v;
            for(j=0; j<n; j++)
            {
                if(i-num[j].t<=1&&i-num[j].t>=0)
                {
                    if(num[j].d>=vv)
                    {
                        sum+=vv;
                        num[j].d-=vv;
                        break;
                    }
                    else
                    {
                        vv-=num[j].d;
                        sum+=num[j].d;
                        num[j].d=0;
                    }
                }
            }
        }
        printf("%d\n",sum);
    }
    return 0;
}