1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#pragma warning(disable:4786)
#pragma warning(disable:4996)
#include <random>
#include <chrono>
#include <ctime>
#include<list>
#include <numeric>
#include<bitset>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<functional>
#include<string>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<utility>
#include<fstream>
#include<sstream>
#include<cmath>
#include<stack>
#include<assert.h>
#include<unordered_map>
#include<unordered_set>
#include <array>
#include <complex>
#include<iomanip>
using namespace std;

#define MEM(a, b) memset(a, (b), sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(X) ( (X) > 0 ? (X) : ( -(X) ) )
#define S(X) ( (X) * (X) )
#define SZ(V) (int )V.size()
#define FORN(i, n) for(int i = 0; i < n; i++)
#define FORAB(i, a, b) for(int i = a; i <= b; i++)
#define ALL(V) V.begin(), V.end()
#define IN(A, B, C)  ((B) <= (A) && (A) <= (C))
#define AIN(A, B, C) assert(IN(A, B, C))

typedef long long int LL;
//typedef __int128 LLL;
typedef long long LLL;

typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PLL> VPL;
typedef vector<PII> VP;
typedef vector<double> VD;
typedef vector<vector<int>> VVI;
typedef vector<string> VS;
typedef long double ld;
typedef unsigned long long ULL;

//#define MAXN 1000
//#define MAXN2 MAXN*MAXN
#define MAXN 100

//const LL MOD[2] = { 87420317, 1000000007 };
//const LL MOD = 1000000007;
const LL MOD = 998244353;
//const LL MOD = 547892069;
//const LL INF = 2000000000000000001LL; //2e18 + 1

int n, k;
LL A[100005], B[100005];
char ans[100005];
int reverseId[100005];
const LL INF = 1000000000000LL;

// Segtree Start
LL first;
int preOffset;

struct Node {
	LL value;
	int id;
};

vector<Node> nodes;

struct Container {
	int v_id;
};

bool operator<(const Container& A, const Container& B) {
	return (nodes[A.v_id].value > nodes[B.v_id].value);
}
multiset<Container> MS;
LL posSum;
LL totalSum;

// Segtree End

struct Solver {
	Solver(LL _g) : g(_g) {
		first = 0;
		preOffset = 0;
		MS.clear();
		posSum = 0;
		totalSum = 0;
		nodes.clear();
		FORN(i, n) ans[i] = 'B';
		ans[n] = 0;
	}

	void SetInsert(Node P) {
		int id = nodes.size();
		nodes.push_back(P);
		MS.insert({ id });
		if (P.value > 0) posSum += P.value;
		totalSum += P.value;
	}

	void SetErase(multiset<Container>::iterator iS) {
		if (nodes[iS->v_id].value > 0) posSum -= nodes[iS->v_id].value;
		totalSum -= nodes[iS->v_id].value;
		MS.erase(iS);
	}

	void Change(LL& base, LL add) {
		if (base > 0) posSum -= base;
		totalSum -= base;
		base += add;
		if (base > 0) posSum += base;
		totalSum += base;
	}

	int insert(int id) {
		first += B[id];
		SetInsert({ B[id] - A[id], id });

		while (first < 0) {
			if (!MS.empty()) {
				auto tmp = *MS.begin();
				Change(nodes[tmp.v_id].value, -first);
				//nodes[tmp.v_id].value += (-first);
			}
			first = 0;
		}

		if (posSum > first) {
			int id = nodes.size();
			nodes.push_back({ 0, 0 });
			auto iS = MS.upper_bound({ id });

			vector<Node> V;
			LL cur = posSum;
			while (true) {
				if (iS == MS.end()) break;
				if (cur + nodes[iS->v_id].value >= first) {
					cur += nodes[iS->v_id].value;
					Change(nodes[iS->v_id].value, -nodes[iS->v_id].value);
					//nodes[iS->v_id].value = 0;
					iS++;
				}
				else {
					break;
				}
			}
			if (iS != MS.end()) {
				auto tmp = *iS;
				//nodes[iS->v_id].value += cur - first;
				Change(nodes[iS->v_id].value, cur - first);
			}

			while (posSum > first) {
				int id = nodes.size();
				nodes.push_back({ 1, 0 });
				auto iS = MS.upper_bound({ id });
				assert(iS != MS.begin());
				iS--;
				auto tmp = *iS;
				LL toDeduct = MIN(posSum - first, nodes[tmp.v_id].value);
				//nodes[iS->v_id].value -= toDeduct;
				Change(nodes[iS->v_id].value, -toDeduct);
				//posSum -= toDeduct;
			}
		}

		while (first > g) {
			if (MS.empty()) return 0;
			auto iS = MS.begin();
			first -= nodes[iS->v_id].value;
			preOffset++;
			ans[nodes[iS->v_id].id] = 'A';
			SetErase(iS);
		}

		while (first - totalSum > g) {
			if (MS.empty()) return 0;
			auto iS = MS.end();
			iS--;
			SetErase(iS);
		}

		return 1;
	}

	int solve(int k) {
		if (preOffset > k) return 0;
		if (preOffset + MS.size() < k) return 0;
		while (preOffset < k) {
			if (MS.empty()) return 0;
			auto iS = MS.begin();
			first -= nodes[iS->v_id].value;
			preOffset++;
			ans[nodes[iS->v_id].id] = 'A';
			SetErase(iS);
		}
		return 1;
	}

	LL g;
};

int possible(LL g) {
	Solver solver(g);

	FORN(i, n) {
		if (!solver.insert(i)) return 0;
	}

	if (!solver.solve(k)) return 0;
	return 1;
}

void solve(int ks) {
	scanf("%d %d", &n, &k);
	FORN(i, n) scanf("%lld", &A[i]);
	FORN(i, n) scanf("%lld", &B[i]);

	LL lo = 0, hi = 100000000000000LL;
	//lo = 2, hi = 3;
	while (lo < hi) {
		LL mid = (lo + hi) / 2;
		if (possible(mid)) {
			hi = mid;
		}
		else {
			lo = mid + 1;
		}
	}
	possible(lo);
	//printf("%lld\n", lo);
	printf("%lld\n%s\n", lo, ans);	

	{
		LL run = 0, curMax = -INF;
		FORN(i, n) {
			if (ans[i] == 'A') run += A[i];
			else run += B[i];
			run = MAX(run, 0);
			curMax = MAX(run, curMax);
		}
		//assert(curMax == lo);
	}
}

void gen() {
}

int main()
{
	double start_time = clock();
#ifdef LOCAL
	freopen("C:\\Home\\Contests\\F\\sample.in", "r", stdin);
	//freopen("C:\\Home\\Contests\\F\\0.out", "w", stdout);
#endif

	gen();

	if (0) {
		int T;
		scanf("%d", &T);
		//AIN(T, 1, 10);
		for (int ks = 1; ks <= T; ks++) {
			solve(ks);
			//if (ks % 1 == 0) fprintf(stderr, "%d done\n", ks);
		}
	}
	else {
		solve(1);
	}

	double end_time = clock();
	fprintf(stderr, "Time = %lf\n", (end_time - start_time) / CLOCKS_PER_SEC);
	return 0;
}