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
#include <bits/stdc++.h>
#define dbg(x) " [" << #x << ": " << (x) << "] "
using namespace std;
template<typename A,typename B>
ostream& operator<<(ostream& out,const pair<A,B>& p) {
    return out << "(" << p.first << ", " << p.second << ")";
}
template<typename T>
ostream& operator<<(ostream& out,const vector<T>& c) {
    out << "{";
    for(auto it = c.begin(); it != c.end(); it++) {
        if(it != c.begin()) out << ", ";
        out << *it;
    }
    return out << "}";
}
template<typename T,typename Q>
ostream& operator<<(ostream& out,const map<T,Q>& c) {
    out << "{";
    for(auto it = c.begin(); it != c.end(); it++) {
        if(it != c.begin()) out << ", ";
        out << *it;
    }
    return out << "}";
}
void solve() {
    int n,k;
    cin >> n >> k;
    vector<int> a(n),b(n);
    for(int& i : a) cin >> i;
    for(int& i : b) cin >> i;
    vector<int> v(n);
    long long res = 1e18;
    int ans;
    for(int msk = 0; msk < (1 << n); msk++) {
        int cnt = 0;
        for(int i = 0; i < n; i++) {
            if(msk & (1 << i)) cnt++;
        }
        if(cnt != k) continue;
        int nw;
        long long mx = 0;
        long long lst = 0;
        for(int i = 0; i < n; i++) {
            if(msk & (1 << i)) nw = a[i];
            else nw = b[i];
            lst = max(0LL,lst + nw);
            mx = max(mx,lst);
        }
        if(mx < res) {
            res = mx;
            ans = msk;
        }
    }
    cout << res << endl;
    for(int i = 0; i < n; i++) {
        if(ans & (1 << i)) cout << 'A';
        else cout << 'B';
    }
    cout << endl;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int testNum = 1;
    //cin >> testNum;
    for(int i = 1; i <= testNum; i++) {
        solve();
    }
    return 0;
}