Problem: 2061D - Kevin and Numbers
Language: java

Solution 1 (runtime: 765 ms):

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class Main {

    public static boolean isprime(long x) {
        if (x == 2 || x == 3 || x == 5) {
            return true;
        }
        for (long i = 2; i <= Math.sqrt(x); i++) {
            if (x % i == 0) {
                return false;
            }
        }
        return true;
    }

    public static long gcd(long a, long b) {
        if (a == 0) {
            return b;
        }
        if (b == 0) {
            return a;
        }
        return gcd(b, a % b);
    }

    static void sort(long[] a) {
        ArrayList<Long> l = new ArrayList<>();
        for (long i : a) {
            l.add(i);
        }
        Collections.sort(l);
        for (int i = 0; i < a.length; i++) {
            a[i] = l.get(i);
        }
    }

    static void sortInt(int[] a) {
        ArrayList<Integer> l = new ArrayList<>();
        for (int i : a) {
            l.add(i);
        }
        Collections.sort(l);
        for (int i = 0; i < a.length; i++) {
            a[i] = l.get(i);
        }
    }

    public static class pair implements Comparable<pair> {

        int x;
        int y;

        public pair(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public int compareTo(pair a) {
            return this.x - a.x;
        }
    }

    public static class pp implements Comparable<pp> {

        long x;
        int y;

        public pp(long x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public int compareTo(pp a) {
            return this.y - a.y; // Corrected the order of comparison
        }
    }

    static Comparator<int[]> customComparator = new Comparator<int[]>() {
        @Override
        public int compare(int[] a, int[] b) {
            // First compare based on the values at index 0
            if (a[0] != b[0]) {
                return a[0] - b[0];
            } else {
                // If values at index 0 are equal, compare based on a[i][1] - a[i][0]
                return a[1] - a[0] - (b[1] - b[0]);
            }
        }
    };

    static long mod = 1_000_000_000 + 7;

    static long lm(long i, long lcm) {
        return (i * (lcm)) / (gcd(i, lcm));
    }

    static long fact[] = new long[200001];

    static long bipow(long x, long y) {
        long z = 1;
        while (y != 0) {
            if ((y & 1) != 0) {
                z = mul(z, x);
            }
            x = mul(x, x);
            y >>= 1;
        }
        return z;
    }

    // static long fact[];
    static long mul(long n, long m) {
        return (n * m) % mod;
    }

    public static long inver(long x) {
        return bipow(x, mod - 2);
    }

    public static long find_combin(long m, long n) {
        long y = mul(fact[(int) (m - n)], fact[(int) n]);
        return mul(fact[(int) m], inver(y));
    }

    public static long modularExponentiation(long a, long b, long m) {
        long result = 1;
        a = a % m; // Ensure 'a' is within the modulo range

        while (b > 0) {
            // If b is odd, multiply a with the result
            if ((b & 1) == 1) {
                result = (result * a) % m;
            }
            // Square a and halve b
            a = (a * a) % m;
            b >>= 1;
        }
        return result;
    }

    public static long modularInverse(long a, long m) {
        return modularExponentiation(a, m - 2, m);
    }
    static HashMap<Integer, Integer> map;

    public static void main(String[] args) {
        Scanner sc = new Scanner();

        int testcase = sc.nextInt();

        for (int ttt = 0; ttt < testcase; ttt++) {

            int n = sc.nextInt();

            int m = sc.nextInt();

            int arr[] = sc.readArray(n);
            int brr[] = sc.readArray(m);


            map = new HashMap<>();


            for (int i = 0; i < n; i++) {
                map.put(arr[i], map.getOrDefault(arr[i], 0) + 1);
            }

            int op = n - m;

            PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());


            for (int i = 0; i < m; i++) {
                pq.add(brr[i]);
            }

            boolean tt = true;

            while (op > 0 && pq.size() > 0 && map.size()>0) {
                int r = pq.remove();
                if (map.containsKey(r)) {
                    map.put(r, map.get(r) - 1);
                    if (map.get(r) == 0) {
                        map.remove(r);
                    }
                    continue;
                }
                else{
                    if(r==1){
                        tt = false;
                        break;
                    }
                    if(r%2==0){
                        pq.add(r/2);
                        pq.add(r/2);
                    }
                    else{
                        pq.add(r/2);
                        pq.add(r/2 + 1);
                    }
                }
                op--;
            }
            if(!tt){
                System.out.println("NO");continue;
            }

            while(!pq.isEmpty()){
                int r = pq.remove();
                if (map.containsKey(r)) {
                    map.put(r, map.get(r) - 1);
                    if (map.get(r) == 0) {
                        map.remove(r);
                    }
                }
                else {
                    tt = false;
                    break;
                }
            }

            if(map.size()>0){
                tt = false;
            }

            if(!tt){
                System.out.println("NO");continue;
            }

            System.out.println("YES");

        }

    }

    // 18 =  9 9 
    static class Scanner {

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer("");

        String next() {
            while (!st.hasMoreTokens()) try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        int[] readArray(int n) {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextInt();
            }
            return arr;
        }

        long[] readLong(int n) {
            long[] arr = new long[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextLong();
            }
            return arr;
        }
    }
}


Solution 2 (runtime: 530 ms):
import java.util.*;
import java.io.*;
import java.math.*;

public class sub {

	//can i get expert by summer please
	
	static int mod = 1000000007;

	public static void main(String args[]) throws IOException {
		int t = sc.nextInt();
		while (t-- > 0) {
			int n = sc.nextInt();
			int m = sc.nextInt();
			int a[] = new int[n];
			for(int i = 0;i<n;i++) {
				a[i]=sc.nextInt();
			}
			int b[] = new int[m];
			PriorityQueue<Integer> pq =new PriorityQueue(Collections.reverseOrder());
			for(int i = 0;i<m;i++) {
				b[i]=sc.nextInt();
				pq.offer(b[i]);
			}
			int moves = n-m;
			int pointer = n-1;
			Arrays.sort(a);
			while(moves>=0 && pointer!=-1 && pq.size()!=0) {
				if(a[pointer]==pq.peek()) {
					pq.poll();
					pointer--;
				}
				else {
					int cur = pq.poll();
					pq.offer(cur/2);
					pq.offer((cur+1)/2);
					moves--;
				}
			}
			if(moves==-1 || pointer!=-1) {
				out.println("NO");
			}
			else {
				out.println("YES");
			}
		}
		out.close();
	}

//	static long bincoef(int n, int k) {
//	    if (n < k) return 0L;
//	    return (p[n] * pow((p[n - k] * p[k]) % mod, mod - 2, mod)) % mod;
//	}

	static long pow(long a, long b, long mod) {
		if (b == 0) {
			return 1L;
		}
		long val = pow(a, b / 2, mod);
		if (b % 2 == 0) {
			return val * val % mod;
		}
		return val * val % mod * a % mod;
	}

	static long gcd(long a, long b) {
		if (b == 0) {
			return a;
		}
		return gcd(b, a % b);
	}

	static long lcm(long a, long b) {
		return a * b / gcd(a, b);
	}

	static Kattio sc = new Kattio();
	static PrintWriter out = new PrintWriter(System.out);

	static class Kattio {

		static BufferedReader r;
		static StringTokenizer st;

		public Kattio() {
			r = new BufferedReader(new InputStreamReader(System.in));
		}

		public String next() {
			try {
				while (st == null || !st.hasMoreTokens()) {
					st = new StringTokenizer(r.readLine());
				}
				return st.nextToken();
			} catch (Exception e) {
				return null;
			}
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public long nextLong() {
			return Long.parseLong(next());
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}
	}
}