#include <bits/stdc++.h>
//N8H+R!dg!ZZ5=+6
using namespace std;
using ll = int;
const ll N=1005;
#define f first
#define s second
ll n,m,dp[N][N];
ll b[N];
ll ans;
pair<ll,ll>a[N];
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>m;
    for(ll i=1;i<=n;i++){
        cin>>a[i].s>>a[i].f;
    }sort(a+1,a+1+n);
    for(ll i=1;i<=m;i++){
        cin>>b[i];
    }sort(b+1,b+1+m);
    for(ll i=1;i<=n;i++){
        for(ll j=1;j<=m;j++){
            dp[i][j]=dp[i-1][j];
            if(a[i].s<=b[j]){
                dp[i][j]=max(dp[i-1][j-1]+1,dp[i][j]);
            }
        }
    }cout<<dp[n][m];
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |