{"author_name":"peryaudo","author_url":"https://blog.hatena.ne.jp/peryaudo/","published":"2010-07-28 18:22:09","provider_name":"Hatena Blog","blog_url":"https://peryaudo.hatenablog.com/","url":"https://peryaudo.hatenablog.com/entry/20100728/1280308929","title":"AOJ 0001 List of Top 3 Hills","version":"1.0","description":"\u554f\u984c\u3092\u958b\u3044\u3066\u304b\u3089\u66f8\u304d\u7d42\u3048\u308b\u307e\u30673'08\"(\u624b\u5143\u306e\u30b9\u30c8\u30c3\u30d7\u30a6\u30a9\u30c3\u30c1\u3088\u308a)\u3002 #include <cstdio> #include <vector> #include <algorithm> using namespace std; int main(){ vector<int> m(10); for(int i = 0; i < 10; i++) scanf(\"%d\\n\", &m[i]); sort(m.begin(), m.end()); for(int i = 0; i < 3; i++) printf(\"%d\\n\", m[9-i]); return 0; }","type":"rich","image_url":null,"blog_title":"\u30da\u30ea\u30e3\u30a6\u30c9\u306e\u65e5","width":"100%","height":"190","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fperyaudo.hatenablog.com%2Fentry%2F20100728%2F1280308929\" title=\"AOJ 0001 List of Top 3 Hills - \u30da\u30ea\u30e3\u30a6\u30c9\u306e\u65e5\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","categories":["Programming","Algorithm","AOJ"]}