{"categories":["C++","TopCoder"],"height":"190","url":"https://boxnos.hatenablog.com/entry/20080527/1211868284","title":" SRM 153 DIV2 Level One","published":"2008-05-27 15:04:44","author_url":"https://blog.hatena.ne.jp/tanakaBox/","description":"\u5c0f\u5b66\u751f\u306e\u5bbf\u984c\u307f\u305f\u3044\u306a\u3002 \u8cb7\u5024\u3068\u58f2\u5024\u3068\u5546\u54c1\u6570\u304c\u3042\u3063\u3066\u3001\u4e00\u756a\u5229\u76ca\u304c\u51fa\u308b\u5546\u54c1\u540d\u8fd4\u3059\u3002\u5229\u76ca\u304c\u7121\u3044\u5834\u5408\u306f\"\"\u3092\u8fd4\u3059\u3002 #include <vector> #include <string> using namespace std; class MostProfitable { public: static string bestItem(vector<int> costs, vector<int> prices, vector<int> sales, vector<string> items) { int best_index; int best = 0; for (int i = 0; i < cos\u2026","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fboxnos.hatenablog.com%2Fentry%2F20080527%2F1211868284\" title=\" SRM 153 DIV2 Level One - \u30dc\u30af\u30ce\u30b9\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","type":"rich","blog_title":"\u30dc\u30af\u30ce\u30b9","provider_name":"Hatena Blog","blog_url":"https://boxnos.hatenablog.com/","provider_url":"https://hatena.blog","width":"100%","version":"1.0","image_url":null,"author_name":"tanakaBox"}