diff --git a/src/main/java/leetcode/editor/cn/FindKthLargestXorCoordinateValue.java b/src/main/java/leetcode/editor/cn/FindKthLargestXorCoordinateValue.java
index b7733c9..91881a1 100644
--- a/src/main/java/leetcode/editor/cn/FindKthLargestXorCoordinateValue.java
+++ b/src/main/java/leetcode/editor/cn/FindKthLargestXorCoordinateValue.java
@@ -64,23 +64,26 @@ public class FindKthLargestXorCoordinateValue {
             int xLength = matrix.length;
             int yLength = matrix[0].length;
             int[][] result = new int[xLength][yLength];
-            List<Integer> xor = new ArrayList<>();
-            for (int i = 0; i < xLength; i++) {
-                for (int j = 0; j < yLength; j++) {
-                    if (i == 0 && j == 0) {
-                        result[0][0] = matrix[0][0];
-                    } else if (i > 0 && j > 0) {
-                        result[i][j] = result[i - 1][j] ^ result[i][j - 1] ^ result[i - 1][j - 1] ^ matrix[i][j];
-                    } else if (i == 0) {
-                        result[i][j] = result[i][j - 1] ^ matrix[i][j];
-                    } else {
-                        result[i][j] = result[i - 1][j] ^ matrix[i][j];
-                    }
+            PriorityQueue<Integer> xor=new PriorityQueue<>((o1,o2) -> {return o2-o1;});
+            result[0][0] = matrix[0][0];
+            xor.add(result[0][0]);
+            for (int i = 1; i < xLength; i++) {
+                result[i][0] = result[i - 1][0] ^ matrix[i][0];
+                xor.add(result[i][0]);
+            }
+            for (int i = 1; i < yLength; i++) {
+                result[0][i] = result[0][i - 1] ^ matrix[0][i];
+                xor.add(result[0][i]);
+            }
+            for (int i = 1; i < xLength; i++) {
+                for (int j = 1; j < yLength; j++) {
+                    result[i][j] = result[i - 1][j] ^ result[i][j - 1] ^ result[i - 1][j - 1] ^ matrix[i][j];
                     xor.add(result[i][j]);
                 }
+            }for(int i=0;i<k-1;i++){
+                xor.poll();
             }
-            Collections.sort(xor);
-            return xor.get(xLength * yLength - k);
+            return xor.peek();
         }
     }
 //leetcode submit region end(Prohibit modification and deletion)