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 <bits/stdc++.h>
using namespace std;
#define oo 1e9
#define fi first
#define se second
#define sp(iiii) setprecision(iiii)
#define IO ios_base::sync_with_stdio(false); cin.tie(0)
#define ms(aaaa,xxxx) memset(aaaa,xxxx,sizeof(aaaa))
#define cntbit(xxxx) __builtin_popcount(xxxx)
#define getbit(xxxx,aaaa) ((xxxx>>(aaaa-1))&1)
#define _cos(xxxx) cos(xxxx*acos(-1)/180)
#define _sin(xxxx) sin(xxxx*acos(-1)/180)
#define _tan(xxxx) tan(xxxx*acos(-1)/180)
#define PE cout<<fixed
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int> piii;
typedef pair<long long,long long> pll;
typedef pair<pair<long long,long long>,long long> plll;
const ld pi=acos(-1);
ll n,m,i,b[500009],res;
pll a[500009];
bool comp(pll x,pll y){
return x.se<y.se;
}
int main(){
IO;
cin>>n>>m;
for (i=1;i<=n;i++) {
cin>>a[i].fi>>a[i].se;
}
for (i=1;i<=m;i++) {
cin>>b[i];
}
sort(a+1,a+n+1,comp);
sort(b+1,b+m+1);
while ((n>0)&&(m>0)) {
//cout<<n<<' '<<m<<' '<<a[n].fi<<' '<<a[n].se<<' '<<b[m]<<'\n';
if ((a[n].fi<=b[m])) {
res++;
n--;
m--;
}
else {
m--;
}
}
cout<<res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |