CodeForces 441B Valera and Fruits

最新推荐文章于 2016-08-17 00:44:50 发布

Silenceneo

最新推荐文章于 2016-08-17 00:44:50 发布

阅读量676

点赞数 1

分类专栏：贪心文章标签： codeforces 贪心

本文链接：https://blog.csdn.net/Silenceneo/article/details/48860717

版权

贪心专栏收录该内容

14 篇文章 0 订阅

订阅专栏

链接：http://codeforces.com/problemset/problem/441/B

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 than v 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 test(s)

Input

2 3
1 5
2 3

Output

Input

Output

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.

直接附上AC代码：

#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <iomanip>
#include <ctime>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
#include <set>
#include <map>
//#pragma comment(linker, "/STACK:102400000, 102400000")
using namespace std;
typedef unsigned int li;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const double pi = acos(-1.0);
const double e = exp(1.0);
const double eps = 1e-8;
const int maxn = 3005;
int n, get, a, b;
int tree[maxn];

int main()
{
	ios::sync_with_stdio(false);
	while (~scanf("%d%d", &n, &get))
	{
		memset(tree, 0, sizeof(tree));
		int maxa = 0;
		while (n--)
		{
			scanf("%d%d", &a, &b);
			tree[a] += b;
			maxa = max(maxa, a);
		}
		int sum = 0;
		for (int i=1; i<=maxa+1; i++)
		{
			if (tree[i] > get)
			{
				sum += get;
				tree[i] -= get;
				if (tree[i] > get)
					tree[i+1] += get;
				else
					tree[i+1] += tree[i];
			}
			else
				sum += tree[i];
		}
		printf("%d\n", sum);
	}
	return 0;
}