<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>hidehusky1996</author_name>
  <author_url>https://blog.hatena.ne.jp/hidehusky1996/</author_url>
  <blog_title>Husky's diary</blog_title>
  <blog_url>https://husky-tech.hatenablog.com/</blog_url>
  <categories>
    <anon>LeetCode</anon>
    <anon>priority queue</anon>
  </categories>
  <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…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fhusky-tech.hatenablog.com%2Fentry%2F2020%2F01%2F02%2F000000_1&quot; title=&quot;LeetCode - Find k Pairs with Smallest Sums - Day2 (1/2/2020) - Husky&amp;#39;s diary&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url>https://cloud.githubusercontent.com/assets/8743900/17332795/0bb46cfe-589e-11e6-90b5-5d3c9696c4f0.png</image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2020-01-02 00:00:00</published>
  <title>LeetCode - Find k Pairs with Smallest Sums - Day2 (1/2/2020)</title>
  <type>rich</type>
  <url>https://husky-tech.hatenablog.com/entry/2020/01/02/000000_1</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
