Runtime: 72 ms (Top 44.52%) | Memory: 128.2 MB (Top 22.61%)

Author: AnasImloul

scripts/algorithms/F/Find K Pairs with Smallest Sums/Find K Pairs with Smallest Sums.java

@@ -1,3 +1,4 @@
+// Runtime: 72 ms (Top 44.52%) | Memory: 128.2 MB (Top 22.61%)
 class Solution {
     public List<List<Integer>> kSmallestPairs(int[] nums1, int[] nums2, int k) {
         PriorityQueue<int []> pq = new PriorityQueue<>(
@@ -6,7 +7,7 @@ public List<List<Integer>> kSmallestPairs(int[] nums1, int[] nums2, int k) {
         for(int i = 0; i < nums1.length && i < k; i++){
             pq.add(new int[]{nums1[i], nums2[0], 0});
         }
-        
+
         List<List<Integer>> res = new ArrayList<>();
         for(int i = 0; i < k && !pq.isEmpty(); i++){
             int [] curr = pq.poll();
@@ -18,4 +19,4 @@ public List<List<Integer>> kSmallestPairs(int[] nums1, int[] nums2, int k) {
         }
         return res;
     }
-}
+}