最小化价格

题解：贪心，先处理人数多的组，把符合条件(能装下整个队伍的地点)的丢到优先队列里（保证没有遗漏可能的解）。然后遍历每个组时取队列里的最小值就可以了。

 

#pragma warning(disable:4996)
#include<queue>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long 
using namespace std;
typedef pair<int, int> P;

const int maxn = 100005;

priority_queue< int, vector<int>, greater<int> >q;

int n, m;
int a[maxn];

bool cmp_1(int aa, int bb) {
    return aa > bb;
}

bool cmp_2(P aa, P bb) {
    return aa.first > bb.first;
}

int main()
{
    while (cin >> n >> m) {
        P p[maxn];
        for (int i = 1; i <= n; i++) cin >> a[i];
        for (int i = 1; i <= m; i++) {
            int u, v;
            cin >> u >> v;
            p[i] = P(u, v);
        }

        sort(a + 1, a + n + 1, cmp_1);
        sort(p + 1, p + m + 1, cmp_2);

        int ans = 0;
        bool flag = true;
        for (int i = 1, j = 1; i <= n; i++) {
            while (p[j].first >= a[i] && j <= m) {
                q.push(p[j].second);
                j++;
            }
            if (q.empty()) {
                flag = false;
                break;
            }
            ans += q.top();
            q.pop();
        }

        if (!flag) cout << "-1" << endl;
        else cout << ans << endl;
    }
    return 0;
}