{"url":"https://a-kawashiro.hatenablog.com/entry/20110418/1303124562","title":"SRM371 div1 medium","blog_url":"https://a-kawashiro.hatenablog.com/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110418%2F1303124562\" title=\"SRM371 div1 medium - a_kawashiro\u306e\u30d6\u30ed\u30b0\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_url":"https://hatena.blog","version":"1.0","author_name":"a_kawashiro","provider_name":"Hatena Blog","published":"2011-04-18 20:02:42","type":"rich","image_url":null,"author_url":"https://blog.hatena.ne.jp/a_kawashiro/","height":"190","description":"\u8caa\u6b32\u3067OK\u3002 us\u306f\u5c0f\u3055\u3044\u65b9\u304b\u3089them\u306e\u5927\u304d\u3044\u65b9\u3068\u6bd4\u8f03\u3002 #include <algorithm> #include <vector> using namespace std; class ChessMatchup { public: int maximumScore(vector <int> us, vector <int> them) { int n=us.size(),ans=0; vector<int> usUsed(n,false); vector<int> themUsed(n,false); sort(us.begin(),us.end()); sort(them.begin(\u2026","width":"100%","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","categories":["topcoder"]}