1202 보석도둑

#include <stdio.h>
#include <vector>
#include <utility>
#include <algorithm>
#include <queue>
 
using namespace std;
 
vector<pair<int, int> > jew;
vector<int> bag;
 
bool compare(pair<int, int> a, pair<int, int> b) {
    if (a.first > b.first) {
        return false;
    }
    else if (a.first < b.first) {
        return true;
    }
    else if (a.first == b.first) {
        return a.second < b.second;
    }
}
 
bool compare2(int a, int b) {
    return a < b;
}
 
int main() {
    int n, k;
    scanf("%d %d", &n, &k);
 
    for (int i = 0; i < n; i++) {
        int m, v;
        scanf("%d %d", &m, &v);
 
        jew.push_back(make_pair(m, v));
    }
 
    sort(jew.begin(), jew.end(), compare);
 
    for (int i = 0; i < k; i++) {
        int tmp;
        scanf("%d", &tmp);
 
        bag.push_back(tmp);
    }
 
    sort(bag.begin(), bag.end(), compare2);
 
    long long sum = 0;
    priority_queue<int> pq;
    for (int i = 0, j = 0; i < k; i++) {
        int size = bag[i], maxV = 0, maxIdx = -1;
        
        for (; j < n && jew[j].first <= size;) {
            pq.push(jew[j].second);
            j++;
        }
        
        if (pq.empty() == false) {
            sum += pq.top();
            pq.pop();
        }
    }
 
    printf("%lld", sum);
}