codeforces Round #274(div2) B解题报告

B. Towers

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

As you know, all the kids in Berland love playing with cubes. Little Petya has n towers consisting of cubes of the same size. Tower with number i consists of ai cubes stacked one on top of the other. Petya defines the instability of a set of towers as a value equal to the difference between the heights of the highest and the lowest of the towers. For example, if Petya built five cube towers with heights (8, 3, 2, 6, 3), the instability of this set is equal to 6 (the highest tower has height 8, the lowest one has height 2).

The boy wants the instability of his set of towers to be as low as possible. All he can do is to perform the following operation several times: take the top cube from some tower and put it on top of some other tower of his set. Please note that Petya would never put the cube on the same tower from which it was removed because he thinks it's a waste of time.

Before going to school, the boy will have time to perform no more than k such operations. Petya does not want to be late for class, so you have to help him accomplish this task.

Input

The first line contains two space-separated positive integers n and k (1 ≤ n ≤ 100, 1 ≤ k ≤ 1000) — the number of towers in the given set and the maximum number of operations Petya can perform. The second line contains n space-separated positive integers ai (1 ≤ ai ≤ 104) — the towers' initial heights.

Output

In the first line print two space-separated non-negative integers s and m (m ≤ k). The first number is the value of the minimum possible instability that can be obtained after performing at most k operations, the second number is the number of operations needed for that.

In the next m lines print the description of each operation as two positive integers i and j, each of them lies within limits from 1 to n. They represent that Petya took the top cube from the i-th tower and put in on the j-th one (i ≠ j). Note that in the process of performing operations the heights of some towers can become equal to zero.

If there are multiple correct sequences at which the minimum possible instability is achieved, you are allowed to print any of them.

Sample test(s)

input

3 2
5 8 5

output

0 2
2 1
2 3

input

3 4
2 2 4

output

1 1
3 2

input

5 3
8 3 2 6 3

output

3 3
1 3
1 2
1 3

Note

In the first sample you need to move the cubes two times, from the second tower to the third one and from the second one to the first one. Then the heights of the towers are all the same and equal to 6.

题目大意：

       给出n个塔，由a[i]个砖块堆起来，整个体系的稳定系数为：最高的高度减去最矮的高度。 可以移动k次，求移动k次中，可以得到的最低的稳定系数，以及如何移动，每次只能移动1个方块。

解法：

      每次只能移动一个，只能移动k次。每次移动意味着有一个塔的高度减少，一个塔的高度增加。根据题目给的稳定系数，将最高塔的高度降下来和最低塔的高度升上去是最佳办法。

      每次寻找最高的塔和最低的塔，然后转移方块，寻找k次。 当稳定系数为0的时候，直接退出，不需要达到k次。 

      PS：由于只需要稳定系数最小，不需要k最小，所以当稳定系数达到最小，例如1，之后的移动可能是重复移动相同的2个塔，例如 高度3与高度2，始终都是稳定系数1，但这并不影响答案。

代码：

#include <cstdio>

int n, k, a[200], x[1010], y[1010], cnt;

void init() {
	scanf("%d%d", &n, &k);
	for (int i = 1; i <= n; i++)  scanf("%d", &a[i]);
}

int fmax() {
	int max=a[1];
	int tmp=1;

	for (int i = 1; i <= n; i++)
		if (max < a[i]) {
			max = a[i];
			tmp = i;
		}

	return tmp;
}

int fmin() {
	int min=a[1];
	int tmp=1;

	for (int i = 1; i <= n; i++)
		if (min > a[i]) {
			min = a[i];
			tmp = i;
		}

	return tmp;
}

void solve() {
	for (int i = 1; i <= k; i++) {
		int maxx = fmax();
		int minx = fmin();

		if (maxx == minx)
			break;

		a[maxx]--;
		a[minx]++;
		cnt++;
		x[cnt] = maxx;
		y[cnt] = minx;
	}

	printf("%d %d\n", a[fmax()]-a[fmin()], cnt);

	for (int i = 1; i <= cnt; i++)
		printf("%d %d\n", x[i], y[i]);
}

int main() {
	init();
	solve();
}