[USACO 2007 Nov G]Sunscreen

// Problem: [USACO 2007 Nov G]Sunscreen
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/20960/1040
// Memory Limit: 65536 MB
// Time Limit: 2000 ms
// 2022-03-08 23:19:52
// 
// Powered by CP Editor (https://cpeditor.org)

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

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
vpii range;
vi b;
int ans;
void solve() {
    int n, m;
    cin >> n >> m;
    for (int i = 1;i <= n; i ++) {
        int l, r;
        cin >> l >> r;
        range.pb({l, r});
    }
    sort(all(range), [&](pii a, pii b) {
        return a.fi > b.fi;
    });
    for (int i =1; i <=m ; i ++) {
        int u, v;
        cin >> u >> v;
        while (v --) {
            b.pb(u);
        }
    }
    sort(all(b), [&](int a1, int b1) {
        return a1 > b1;
    });
    for (int i = 1; i<= n; i ++) {
        for (int j = 0; j < b.size(); j ++) {
            if (b[j] >= range[i - 1].fi && b[j] <= range[i - 1].se) {
                ans ++;
                b[j] = -1;
                break;
            }
        }
    }
   cout << ans<< endl;

}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

通过对最小值从大到小排序，以及防晒霜从大到小排序，这样就能尽量满足所有奶牛。