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
// 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i, p, k) for(int i(p); i < k; ++i)
typedef long long int ll;
typedef long double ld;
template <typename T = int> inline T in()
{
    T x;
    std::cin >> x;
    return x;
}
int main()
{
    std::cin.tie(nullptr); std::cout.tie(nullptr); std::ios_base::sync_with_stdio(0);
    int n(in()), k(in());
    std::vector <int> tab[2]{};
    rep(b, 0, 2)rep(i, 0, n)tab[b].push_back(in());
    ll wyn(1e18);
    std::string odp;
    rep(m, 0, (1 << n))
    {
        int s(0);
        rep(i, 0, n)if(m & (1 << i)) ++s;
        if(s != k)continue;
        ll min(0), max(0), sum(0);
        rep(i, 0, n)
        {
            sum += tab[!(m & (1 << i))][i];
            if(sum < min)min = sum;
            if(sum - min > max)max = sum - min;
        }
        if(max < wyn)
        {
            wyn = max;
            odp = "";
            rep(i, 0, n)odp += char('A' + !(m & (1 << i)));
        }
    }
    std::cout << wyn <<'\n'<<odp<<'\n';

    return 0;
}