제출 #209684

#제출 시각아이디문제언어결과실행 시간메모리
209684AutoratchExhibition (JOI19_ho_t2)C++14
100 / 100
85 ms5636 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 = n-1,j = m-1;
    while(i>=0 and j>=0)
    {
        if(b[j]>=a[i].second) ans++,i--,j--;
        else i--;
    }
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...