#include <vector>
#include <cstring>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>

using namespace std;

#define f first
#define s second
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define all(v) (v).begin(), (v).end()
#define forit(it,v) for (typeof(v.begin()) it = v.begin(); it != v.end(); ++it)
#define ll long long

int cur[10000];
class TomekPhone {
    public:
    int minKeystrokes(vector <int> cnt, vector <int> key) {
        sort(all(cnt));
        reverse(all(cnt));

        int j = 0;

        for (int i = 0; i < key.size(); ++i)
            cur[i] = 1;

        int ans = 0;
        forit(it, cnt) {

            int pos = -1;

            for (int i = 0; i < key.size(); ++i)
                if (cur[i] <= key[i] && (pos == -1 || cur[pos] > cur[i])) {
                    pos = i;
                }

            if (pos == -1) return -1;

            ans += cur[pos] * (*it);
            cur[pos]++;
        }
        return ans;
    }
};