1587. Eat or Be Eaten

soj.me/1587

#include <iostream>#include <algorithm>#include <cstring>using namespace std;int a[20001],b[20001];int cmp(int a,int b){return a<b;}int f(int min,int max,int t){int mid=(min+max)/2;if(b[max-1]<t)return max;else if(b[0]>=t)return 0;while(min<=max){mid=(min+max)/2;if(b[mid]>=t)max=mid-1;else min=mid+1;}return min;}int main(){int t;cin>>t;while(t--){memset(a,0,sizeof(a));memset(b,0,sizeof(b));int n,m;cin>>n>>m;for(int i=0;i<n;i++)cin>>a[i];for(int i=0;i<m;i++)cin>>b[i];sort(a,a+n,cmp);sort(b,b+m,cmp);int ans=0;for(int i=0;i<n;i++)ans+=(f(0,m,a[i]));cout<<ans<<endl;}return 0;}