Submission #209256

#TimeUsernameProblemLanguageResultExecution timeMemory
209256AutoratchExhibition (JOI19_ho_t2)C++14
0 / 100
5 ms376 KiB
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5;

int n,m;
pair<long long,long long> a[N];
long long b[N],ans;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> m;
    for(int i = 0;i < n;i++) cin >> a[i].second >> a[i].first;
    for(int i = 0;i < m;i++) cin >> b[i];
    sort(a,a+n),sort(b,b+m);
    int i = 0,j = 0;
    while(j<m)
    {
        if(b[j]>=a[i].second) ans++,i++,j++;
        else j++;
    }
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...