Submission #76246255

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define ll long long
#define ull unsigned long long
#define inf 1e18
#define eps 1e-9
#define endl "\n"
#define il inline
#define ls 2*k
#define rs 2*k+1
using namespace std;
const int N=2e5+5,M=2e6+5;
const int mod=998244353;
inline int read(){
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();
    return x*f;
}
int n,m,a[N],b[N];
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int tc=1;
	while(tc--){
		cin>>n>>m;
		for(int i=1;i<=n;i++) cin>>a[i];
		for(int i=1;i<=m;i++) cin>>b[i];
		sort(a+1,a+n+1);
		sort(b+1,b+m+1);
		int pos=1,ans=0;
		for(int i=1;i<=m;i++){
			while(pos<=n && a[pos]*2<b[i]) ++pos;
			if(pos<=n) ans++,pos++;
//			cout<<i<<' '<<pos<<'\n'; 
		}
		cout<<ans<<'\n';
	}
	return 0;
}
/*

*/

Submission Info

Judge Result