Submission #1308910

#TimeUsernameProblemLanguageResultExecution timeMemory
1308910wangzhiyi33Exhibition (JOI19_ho_t2)C++20
0 / 100
2 ms1280 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define fir first
#define sec second

bool cmp(pair<int,int>a,pair<int,int>b){
    if(a.sec!=b.sec){
        return a.sec>b.sec;
    }
    return a.fir<b.fir;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n,m;
    cin>>n>>m;
    pair<int,int>s[n+1];
    for(int q=1;q<=n;q++){
        cin>>s[q].fir>>s[q].sec;
    }
    sort(s+1,s+n+1,cmp);
    int c[m+1];
    for(int q=1;q<=m;q++)cin>>c[q];
    sort(c+1,c+m+1,greater<int>());

    int pos=1;
    int ans=0;

    for(int q=1;q<=n && pos<=m;q++){
        if(s[q].fir>c[pos])continue;
        ans++; pos++;
    }
    cout<<ans<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...