# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
217328 | kshitij_sodani | Exhibition (JOI19_ho_t2) | C++17 | 93 ms | 5756 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#define endl "\n"
llo mod=1000000007;
llo n,m;
pair<llo,llo> it[100002];
llo aa[100001];
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>n>>m;
for(llo i=0;i<n;i++){
cin>>it[i].b>>it[i].a;
}
for(llo i=0;i<m;i++){
cin>>aa[i];
}
sort(it,it+n);
sort(aa,aa+m);
llo ind=m-1;
llo tot=0;
for(llo i=n-1;i>=0;i--){
if(it[i].b<=aa[ind]){
tot+=1;
ind-=1;
}
}
llo low=0;
llo high=m;
cout<<tot<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |