poj4014 Dice

//============================================================================
// Name        : 4014.cpp
// Author      : sww
// Version     : 1.0
// Time	       : 2014-03-24 16:55:00
//===========================================================================

#include <stdio.h>
#include <algorithm>
#define N 1000
using namespace std;


typedef struct node {
	int index;
	int a;
	int start;
} Node;

Node data[N];

int cmp1(const Node&a, const Node &b) {
	if (a.a > b.a)
		return 1;
	else
		return 0;
}

int cmp2(const Node&a, const Node &b) {
	if (a.index < b.index)
		return 1;
	else
		return 0;
}

int main() {
	int n;
	scanf("%d", &n);


	int sum = 0;
	for (int i = 0; i < n; i++) {
		data[i].index = i;
		scanf("%d", &data[i].a);
		sum += data[i].a;
	}

	sort(data, data + n, cmp1);

	int st = 1;
	double e = 0;
	for (int i = 0; i < n; i++) {
		data[i].start = st;
		st += data[i].a;
		double temp = data[i].start* data[i].a + data[i].a * (data[i].a - 1) / 2;
		e += temp / data[i].a;
	}
	printf("%f\n", e);
	sort(data, data + n, cmp2);
	for (int i = 0; i < n; i++) {
		printf("%d", data[i].start);
		for (int j = 1; j < data[i].a; j++) {
			int out = data[i].start + j;
			printf(" %d", out);
		}
		puts("");
	}
	return 0;
}