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
#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

template<typename _T> inline void _DBG(const char *s, _T x) { cerr << s << " = " << x << "\n"; }
template<typename _T, typename... args> void _DBG(const char *s, _T x, args... a) { while(*s != ',') cerr << *s++; cerr << " = " << x << ','; _DBG(s + 1, a...); }

#ifdef LOCAL
#define _upgrade ios_base::sync_with_stdio(0);
#define DBG(...) _DBG(#__VA_ARGS__, __VA_ARGS__)
#else
#define _upgrade ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define DBG(...) (__VA_ARGS__)
#define cerr if(0) cout
#endif

// ********************** CODE ********************** //

const LL INF = 1e18;

int n, k;

vector<LL> A, B;

int main()
{
    _upgrade
    
    cin >> n >> k;

    A.resize(n);
    B.resize(n);
    for (int i = 0; i < n; i++)
        cin >> A[i];
    for (int i = 0; i < n; i++)
        cin >> B[i];

    pair<LL, int> best = {INF, -1};
    for (int m = 0; m < (1 << n); m++)
    {
        if (__builtin_popcount(m) == n - k)
        {
            LL sm = 0, mx = 0;
            for (int i = 0; i < n; i++)
            {
                LL x = (((m >> i) & 1) ? B[i] : A[i]);
                sm = max(0LL, sm + x);
                mx = max(mx, sm);
            }
            best = min(best, make_pair(mx, m));
        }
    }
    cout << best.first << "\n";
    for (int i = 0; i < n; i++)
    {
        if ((best.second >> i) & 1)
            cout << "B";
        else
            cout << "A";
    }
    cout << "\n";

    return 0;
}