보석도둑

//보석도둑
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
 
#define MAXX 300001
 
using namespace std;
 
typedef long long ll;
 
int n, k;
typedef pair<int, int> pp;
 
bool compare(const pp &a, const pp &b)
{
    if (a.first > b.first)
        return true;
    else if (a.first == b.first)
    {
        if (a.second > b.second)
            return true;
        else
            return false;
    }
    else
        return false;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
 
    cin >> n >> k;
 
    vector<pp> jewels;
    for (int i = 0; i < n; i++)
    {
        int m, v;
        cin >> m >> v;
        jewels.push_back(pp(v, m));
    }
    sort(jewels.begin(), jewels.end(), compare);
 
    multiset<int> bag;
    for (int i = 0; i < k; i++)
    {
        int c;
        cin >> c;
        bag.insert(c); //자동 정렬을 위해 중복 key값이 가능한 multiset을 사용
    }
 
    ll ans = 0;
    vector<pp>::iterator idx;
    for (idx = jewels.begin(); idx != jewels.end() && !bag.empty(); idx++)
    {
        multiset<int>::iterator value = bag.lower_bound(idx->second);
 
        if (value != bag.end())
        {
            ans += idx->first;
            bag.erase(value);
        }
    }
    cout << ans << '\n';
    return 0;
}