CF--Boring Partition--思维

D. Boring Partition

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

This problem is the most boring one you've ever seen.

Given a sequence of integers a1, a2, ..., an and a non-negative integer h, our goal is to partition the sequence into two subsequences (not necessarily consist of continuous elements). Each element of the original sequence should be contained in exactly one of the result subsequences. Note, that one of the result subsequences can be empty.

Let's define function f(ai, aj) on pairs of distinct elements (that is i ≠ j) in the original sequence. If ai and aj are in the same subsequence in the current partition then f(ai, aj) = ai + aj otherwise f(ai, aj) = ai + aj + h.

Consider all possible values of the function f for some partition. We'll call the goodness of this partiotion the difference between the maximum value of function f and the minimum value of function f.

Your task is to find a partition of the given sequence a that have the minimal possible goodness among all possible partitions.

Input

The first line of input contains integers n and h (2 ≤ n ≤ 105, 0 ≤ h ≤ 108). In the second line there is a list of n space-separated integers representing a1, a2, ..., an (0 ≤ ai ≤ 108).

Output

The first line of output should contain the required minimum goodness.

The second line describes the optimal partition. You should print n whitespace-separated integers in the second line. The i-th integer is 1 if ai is in the first subsequence otherwise it should be 2.

If there are several possible correct answers you are allowed to print any of them.

Examples

input

Copy

3 2
1 2 3

output

Copy

1
1 2 2 

input

Copy

5 10
0 1 0 2 1

output

Copy

3
2 2 2 2 2 

Note

In the first sample the values of f are as follows: f(1, 2) = 1 + 2 + 2 = 5, f(1, 3) = 1 + 3 + 2 = 6 and f(2, 3) = 2 + 3 = 5. So the difference between maximum and minimum values of f is 1.

In the second sample the value of h is large, so it's better for one of the sub-sequences to be empty.

题意：

将数划分为两块，每一块中函数计算的表达式是ai+aj，不同块中函数表达式为ai+aj+h。求表达式最大值-表达式最小值 的最小值。

有两种情况，先排序，一种情况是全部为同一个序列，另一种是最小的在一组，其他在第二组：

1、全部为同一个序列看      最大值为an+an-1 最小值为a1+a2 min1=(max-min)

2、最小值自己在一个序列，其他为一个序列   最大值可能为an+an-1 或a1+an+h 最小值可能为a1+a2+h 或a2+a3 min2=(max-min)

参考：https://blog.csdn.net/mengxiang000000/article/details/78241019

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=100000+66;
const ll mod=1e9+7;
int n,m;
ll a[maxn];
int main()
{
    scanf("%d %d",&n,&m);
    ll minn=1e18;
    int id=1;
    for(int i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
        if(a[i]<minn)
        {
            minn=a[i];
            id=i;
        }
    }
    sort(a+1,a+n+1);
    //全部为本身
    ll l1=a[n]+a[n-1];
    ll l11=a[1]+a[2];
    //----最小值1个，其他为2队伍
    ll l2=a[1]+a[n]+m;
    ll l22=a[n]+a[n-1];

    ll hm=min(a[1]+a[2]+m,a[2]+a[3]);
    ll hmm=max(l2,l22);

    ll min1=abs(hmm-hm);
    ll min2=abs(l1-l11);
    if(min1<=min2)
    {
        printf("%lld\n",min1);
        for(int i=1;i<=n;i++)
        {
            if(i==id)printf("1 ");
            else printf("2 ");
        }
    }else
    {
        printf("%lld\n",min2);
        for(int i=1;i<=n;i++)
        {
            printf("2 ");
        }
    }
}