我是刚学OI不久的女生,不知道为什么WA了，求助。。。

/************************************************
 * Au: Hany01
 * Date: Aug 5th, 2018
 * Prob: BZOJ1563 诗人小G
 * Email: hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
    static int _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 1e5 + 5;

LD dp[maxn];
int n, l, p, sum[maxn], pre[maxn], top;
PII stk[maxn];
char str[maxn][35];

inline LD calc(int i, int j) {
    return dp[j] + pow((LD)abs(l - sum[i] + sum[j] - i + j + 1), p);
}

void print(int cur) {
    if (!cur) return; print(pre[cur]);
    For(i, pre[cur] + 1, cur) printf("%s%c", str[i], i == cur ? '\n' : ' ');
}

int main()
{
#ifdef hany01
    freopen("bzoj1563.in", "r", stdin), freopen("bzoj1563.out", "w", stdout);
#endif

    for (static int Cas = read(), pos; Cas --; ) {
        n = read(), l = read(), p = read();
        For(i, 1, n) scanf("%s", str[i]), sum[i] = sum[i - 1] + strlen(str[i]), dp[i] = 0;
		stk[top = 1] = mp(0, 0);
		cerr << Cas << endl;
        For(i, 1, n) {
			dp[i] = calc(i, pos = stk[upper_bound(stk + 1, stk + 1 + top, mp(i, INF)) - stk - 1].y);
			pre[i] = pos;
			if (calc(n, i) <= calc(n, stk[top].y)) {
				stk[++ top] = mp(n, i);
				for (register int l, r, mid; ; ) {
					l = max(stk[top - 1].x, i + 1), r = n;
					while (l < r) {
						mid = (l + r) >> 1;
						if (calc(mid, stk[top - 1].y) >= calc(mid, i)) r = mid; else l = mid + 1;
					}
					stk[top].x = l;
					if (stk[top].x > stk[top - 1].x) break;
					stk[top - 1] = stk[top], -- top;
				}
			}
		}
		if (dp[n] > 1e18 + 1e-9) puts("Too hard to arrange");
		else printf("%lld\n", (LL)dp[n]), print(n);
		if (Cas) puts("--------------------");
		else rep(i, 20) putchar('-');
	}

	return 0;
}gd