CodeForces - 364B Free Market （Dp+贪心思想结合 ）

John Doe has recently found a "Free Market" in his city — that is the place where you can exchange some of your possessions for other things for free.

John knows that his city has n items in total (each item is unique). You can bring any number of items to the market and exchange them for any other one. Note that each item is one of a kind and that means that you cannot exchange set {a, b} for set {v, a}. However, you can always exchange set x for any set y, unless there is item p, such that p occurs in x and p occurs in y.

For each item, John knows its value c_i. John's sense of justice doesn't let him exchange a set of items x for a set of items y, if s(x) + d < s(y) (s(x) is the total price of items in the set x).

During one day John can exchange only one set of items for something else. Initially, he has no items. John wants to get a set of items with the maximum total price. Find the cost of such set and the minimum number of days John can get it in.

Input

The first line contains two space-separated integers n, d (1 ≤ n ≤ 50, 1 ≤ d ≤ 10⁴) — the number of items on the market and John's sense of justice value, correspondingly. The second line contains n space-separated integers c_i (1 ≤ c_i ≤ 10⁴).

Output

Print two space-separated integers: the maximum possible price in the set of items John can get and the minimum number of days needed to get such set.

Examples

Input

3 2
1 3 10

Output

4 3

Input

3 5
1 2 3

Output

6 2

Input

10 10000
10000 9999 1 10000 10000 10000 1 2 3 4

Output

50010 6

Note

In the first sample John can act like this:

• Take the first item (1 - 0 ≤ 2).
• Exchange the first item for the second one (3 - 1 ≤ 2).
• Take the first item (1 - 0 ≤ 2).

题目大意：

（1）有n种不同的物体，每种物体对应各自的价值Ci。

（2）John发现有一个自由市场可以交换物品，交换规则为：拿出去交换的物品集合A与交换回来的物品集合B之间不能有相同的物体（即A，B交集为空），可以拿空集交换。

（3）John还是要脸的，给出一个John的廉耻值d，每次交换后所得利润不能超过d（即s（A）-s（B）< =d），且每天只能交换一次。

（4）求出这样交换之后所可能获得的最大价值和所花费的最小天数。

解题大意：

拿到题目，感受到一股贪心的气息。

要求天数最少，那么每天需要在额度d内是价值增量尽可能地大。可以用一个数组预处理来记录每种状态是否可能达到。达到记为1，默认置0。之后用循环模拟，一轮代表一天，每次数组下标从该天所可能取到的最大值开始（前一天的价值+d）向前倒退直到值为1，该天的价值即为下标。若倒退完之后仍未找到值为1的下标，则退出循环，输出答案。

#include <iostream>
#include <string>
#include <climits>
#include <cstdio>
#include <vector>
using namespace std;
const int maxn=100000+5;
int dp[51*10001];
int c[55];
int main(){			//by bibibi CSDN 
	int n,d,sum=0;
	cin>>n>>d;
	dp[0]=1;
	for(int i=0;i<n;i++){
		int x;
		cin>>x;	
		for(int j=(sum+=x);j>=x;j--){
			if(dp[j-x]) dp[j]=1;
		}
	}
	int w=0,day=0;
	while(1){
		int j=w+d;
		while(!dp[j] && j>w) j--;
		if(j==w) break;
		w=j;day++;	
	}
	cout<<w<<" "<<day<<endl;
}