{"type":"rich","image_url":"https://cloud.githubusercontent.com/assets/8743900/17332795/0bb46cfe-589e-11e6-90b5-5d3c9696c4f0.png","title":"LeetCode - Find k Pairs with Smallest Sums - Day2 (1/2/2020)","height":"190","author_name":"hidehusky1996","blog_title":"Husky's diary","description":"Find k Pairs with Smallest Sums Question You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k. Define a pair (u,v) which consists of one element from the first array and one element from the second array. Find the k pairs (u1,v1),(u2,v2) ...(uk,vk) with the sma\u2026","author_url":"https://blog.hatena.ne.jp/hidehusky1996/","blog_url":"https://husky-tech.hatenablog.com/","url":"https://husky-tech.hatenablog.com/entry/2020/01/02/000000_1","published":"2020-01-02 00:00:00","categories":["LeetCode","priority queue"],"provider_name":"Hatena Blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fhusky-tech.hatenablog.com%2Fentry%2F2020%2F01%2F02%2F000000_1\" title=\"LeetCode - Find k Pairs with Smallest Sums - Day2 (1/2/2020) - Husky&#39;s diary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","width":"100%","version":"1.0","provider_url":"https://hatena.blog"}