Problem: 2061D - Kevin and Numbers
Language: java

Solution 1 (runtime: 702 ms):
import java.util.*;
import java.io.*;
 
public class cp {
    static class Datamax implements Comparable<Datamax>{
        int idx;
        int val;
        public Datamax(int val,int idx){
            this.idx = idx;
            this.val = val;
        }
        @Override
        public int compareTo(Datamax p1){
            if(this.val<p1.val) return 1;
            return -1;
        }
    }
    static class Circle{
        int x;
        int y;
        int radius;
        public Circle(int x,int y,int radius){
            this.x = x;
            this.y = y;
            this .radius = radius;
        }
    }
    // static class Edge {
    //     int dst;
    //     int dir;
    //     public Edge(int dst,int dir){
    //         this.dir = dir;
    //         this.dst = dst;
    //     }
    // }
    public static PP.Reader cs = new PP.Reader(System.in);
    // public static Scanner cs = new Scanner(System.in);
    public static BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));
    public static void main(String[] args) throws IOException{
        int tests = cs.nextInt();
        while(tests>0){
            tests--;
            solve();
        }
        // writer.flush();
        writer.close();
    }
    public static long mod = (long)Math.pow(10,9) + 7;
    public static long MOD = 998244353;
    public static int netchange = 0;
    public static boolean poss;
    // public static int nodes = 0;
    public static void solve() throws IOException{
        // long it = cs.nextLong();
        // int n = (int)it;
        int n = cs.nextInt();
        int m = cs.nextInt();
        // int k = cs.nextInt();
        // long k = cs.nextLong();  
        // String str = cs.next();
        // String strb = cs.next();
        // long[] arr = new long[n];
        // long[] brr = new long[m];
        HashMap<Long,Integer> hm = new HashMap<>();
        for(int i = 0; i < n; i++){
            long temp = cs.nextLong();
            if(hm.containsKey(temp)) hm.put(temp,hm.get(temp)+1);
            else hm.put(temp,1);
        }
        boolean answer = true;
        for(int i = 0; i < m; i++){
            long temp = cs.nextLong();
            if(!check_existence(hm, temp)){
                answer = false;
            }
        } 
        if(!hm.isEmpty() || !answer) System.out.println("No");
        else System.out.println("Yes");
    }
    //Write fxn here     
    public static boolean check_existence(HashMap<Long,Integer> hm,long element){
        if(hm.containsKey(element)){
            if(hm.get(element) == 1) hm.remove(element);
            else hm.put(element,hm.get(element)-1);
            return true;
        }
        if(element == 1) return false;
        long first = element/2;
        long second = element/2;
        if(element%2 == 1) second++;
        return check_existence(hm,first) && check_existence(hm,second);
    }
    public static void dfs(ArrayList<ArrayList<Integer>> graph,int curr,int changed[]){
        for(Integer nb : graph.get(curr)){
            if(changed[nb] != 0){
                if(changed[nb] == changed[curr]) poss = false;
            }
            else{
                if(changed[curr] == 1) changed[nb] = -1;
                else changed[nb] = 1;
                netchange += changed[nb];
                dfs(graph,nb, changed);
            }
        }
    }
    public static  int binary(int[] arr,int start,int end,int key){
        int mid = (int)start;
        int st = start;
        int en = end;
        while(start<=end){
            mid = (int)(start+end)/2;
            if(arr[mid]==key) return mid;
            else if(arr[mid]>key) end = mid-1;
            else if(arr[mid]<key) start = mid+1;
        }
        //if(end<start){
            if(end<st) end++;
            // if(start>en) start--;
            // if(Math.abs(arr[end]-key)<=Math.abs(arr[start]-key-1)){
                // return start;
            // }
            return end;
        //}
        //return mid+1;
    }
    public static long invmod(long A, long M)
    {
 
        for (int X = 1; X < (int)M; X++)
            if (((A % M) * (X % M)) % M == 1)
                return X;
        return 1;
    } 
    public static long gcd(long a,long b){
        long c = Math.min(a,b);
        long d = Math.max(a,b);
        if(d%c==0) return c;
        return gcd(c,d%c);
    }
    public static long divmod(long a,long b,long m){   //claculate (a/b)%m
        // a = a%m;b = b%m  // Include if not working
        long inv =  powermod(b, m-2, m);
        return (inv*a)%m;
    }
    static long powermod(long x, long y, long p) //calculate (x^y)%p
    {
        long res = 1;
        x = x % p; 
        while (y > 0) {
            if ((y & 1) > 0)
                res = (res * x) % p;
            y = y >> 1; 
            x = (x * x) % p;
        }
        return res;
    }
}

class PP {
    static String IN = "%s";
    static String OUT = "%s";

    static class Reader {
        BufferedReader br;
        StringTokenizer st;

        Reader(InputStream is) {
            br = new BufferedReader(new InputStreamReader(is));
        }

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

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

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

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

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());
		}
	}
}