如何在java中对带key和value的未排序数组使用二进制查找？

import java.util.Arrays;

public class BinarySearchExample {
    public static void main(String[] args) {
        // 定义一个带有key和value的未排序数组
        int[][] array = {{5, 10}, {2, 20}, {10, 30}, {7, 40}, {3, 50}};

        // 对数组按照key进行排序
        Arrays.sort(array, (a, b) -> Integer.compare(a[0], b[0]));

        // 要查找的key
        int targetKey = 7;

        // 使用二进制查找算法查找指定的key
        int index = binarySearch(array, targetKey);

        // 输出查找结果
        if (index != -1) {
            System.out.println("找到了，value为：" + array[index][1]);
        } else {
            System.out.println("未找到指定的key");
        }
    }

    private static int binarySearch(int[][] array, int targetKey) {
        int left = 0;
        int right = array.length - 1;

        while (left <= right) {
            int mid = left + (right - left) / 2;

            if (array[mid][0] == targetKey) {
                return mid;
            } else if (array[mid][0] < targetKey) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }

        return -1;
    }
}