<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>tanakaBox</author_name>
  <author_url>https://blog.hatena.ne.jp/tanakaBox/</author_url>
  <blog_title>ボクノス</blog_title>
  <blog_url>https://boxnos.hatenablog.com/</blog_url>
  <categories>
    <anon>C++</anon>
    <anon>TopCoder</anon>
  </categories>
  <description>小学生の宿題みたいな。 買値と売値と商品数があって、一番利益が出る商品名返す。利益が無い場合は&quot;&quot;を返す。 #include &lt;vector&gt; #include &lt;string&gt; using namespace std; class MostProfitable { public: static string bestItem(vector&lt;int&gt; costs, vector&lt;int&gt; prices, vector&lt;int&gt; sales, vector&lt;string&gt; items) { int best_index; int best = 0; for (int i = 0; i &lt; cos…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fboxnos.hatenablog.com%2Fentry%2F20080527%2F1211868284&quot; title=&quot; SRM 153 DIV2 Level One - ボクノス&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></image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2008-05-27 15:04:44</published>
  <title> SRM 153 DIV2 Level One</title>
  <type>rich</type>
  <url>https://boxnos.hatenablog.com/entry/20080527/1211868284</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
