P2 (THAM QUAN)

#include <bits/stdc++.h>
#define int64_t long long
using namespace std;

const int N = 30005;
typedef pair<int, int> ii;

int n, m;
ii d[N], v[N];

int64_t s = 0;
vector<ii> res;

int main() {
    //freopen("THAMQUAN.inp", "r", stdin);
    //freopen("THAMQUAN.out", "w", stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);

    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        cin >> d[i].first;
        d[i].second = i;
    }

    sort(d + 1, d + n + 1, greater<ii>());

    for(int i = 1; i <= m; i++) {
        cin >> v[i].first;
        v[i].second = i;
    }

    sort(v + 1, v + m + 1);

    for(int i = 1; i <= n; i++) {
        s = s + d[i].first * v[i].first;
        res.push_back({d[i].second, v[i].second});
    }
    sort(res.begin(), res.end());

    cout << s << '\n';
    for(int i = 0; i < n; i++)
        cout << res[i].second << '\n';

    return 0;
}