p7795.java

/*
    먹을 것인가 먹힐 것인가
    이분탐색
*/
import java.io.*;
import java.util.*;

public class p7795 {
    static int t;
    static int n, m;
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st;
        t = Integer.parseInt(br.readLine());

        while(t-- > 0) {
            st = new StringTokenizer(br.readLine());
            n = Integer.parseInt(st.nextToken());
            m = Integer.parseInt(st.nextToken());
            int[] a = new int[n + 1];
            int[] b = new int[m + 1];

            st = new StringTokenizer(br.readLine());
            for (int i = 1; i <= n; i++) {
                a[i] = Integer.parseInt(st.nextToken());
            }
            st = new StringTokenizer(br.readLine());
            for (int i = 1; i <= m; i++) {
                b[i] = Integer.parseInt(st.nextToken());
            }

            Arrays.sort(b, 1, m + 1);

            int ans = 0;
            for (int i = 1; i <= n; i++) {
                ans += solution(b, 1, m, a[i]);
            }
            System.out.println(ans);
        }
    }

    // target보다 작은 게 몇개 있는지 카운트 해서 리턴
    static int solution(int[] arr, int l, int r, int target) {
        int ret = l - 1;

        while (l <= r) {
            int mid = (l + r) / 2;
            if (arr[mid] < target) {
                ret = mid;
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }

        return ret;
    }
}