Submission #1342531

#TimeUsernameProblemLanguageResultExecution timeMemory
1342531ttparin_Exhibition (JOI19_ho_t2)C++20
100 / 100
115 ms1584 KiB
#include<bits/stdc++.h>
using namespace std;
pair<int,int> a[100010];
int b[100010];
int main(){
 int n,m;
 cin>>n>>m;
 for(int i=1;i<=n;i++){
    cin>>a[i].second;
    cin>>a[i].first;
 }
 for(int i=1;i<=m;i++){
    cin>>b[i];
 }
 sort(a+1,a+n+1);
 sort(b+1,b+m+1);
 int j=m;
 int ans=0;
 for(int i=n;i>=1;i--){
    if(j<1)
        break;
    if(a[i].second<=b[j]){
        ans++;
        j--;
    }
 }
 cout<<ans;
 return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...