// https://discuss.leetcode.com/topic/50527/java-10ms-solution-no-priority-queueclass Solution {public:    vector
     
      
       > kSmallestPairs(vector
       
        & nums1, vector
        
         & nums2, int k) {        sort(nums1.begin(), nums1.end());        sort(nums2.begin(), nums2.end());        vector
         
           buf1(nums1.size(), 0);        vector
          
           
            > vpair; int minV = INT_MAX; int tmpV = -1; while (vpair.size() < k) { for (int i=0; i