View Code of Problem 3815

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <fstream>
#include <algorithm>
#include <ctime>
using namespace std;

#define MAX(a,b) (a)>(b)?(a):(b)
#define INF 0x3f3f3f3f
#define MAXN 50010

typedef long long ll;
const int mod=1000000009;

int a[MAXN],b[MAXN];
int n,m,k;

bool cmp(int a,int b)
{
    if(a>b) return true;
    else return false;
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%d",&n,&m,&k);
        for(int i=0;i<n;i++)
            scanf("%d",a+i);
        for(int i=0;i<m;i++)
            scanf("%d",b+i);
        sort(a,a+n);
        sort(b,b+m,cmp);
        int cnt=0;
        int j=0;
        for(int i=0;i<n&&j<m;i++)
        {
            if(a[i]+b[j]>=k)
            {
                cnt++;
                j++;
            }
        }
        printf("%d\n",cnt);
    }
    return 0;
}

Double click to view unformatted code.


Back to problem 3815