{"width":"100%","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110328%2F1301296147\" title=\"AOJ0112 - 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>","blog_url":"https://a-kawashiro.hatenablog.com/","provider_url":"https://hatena.blog","title":"AOJ0112","url":"https://a-kawashiro.hatenablog.com/entry/20110328/1301296147","published":"2011-03-28 16:09:07","author_url":"https://blog.hatena.ne.jp/a_kawashiro/","categories":[],"image_url":null,"type":"rich","version":"1.0","description":"\u5f15\u3063\u639b\u3051\u554f\u984c\u3002\u8a34\u3048\u3066\u3084\u308b\u3002(LL\u306b\u3057\u306a\u3044\u3068\u6ea2\u308c\u307e\u3059\u3002\uff09 #include <iostream> #include <vector> #include <algorithm> typedef long long LL; using namespace std; void solve(int n) { LL r=0; vector<LL> v(n); for(int i=0;i<n;i++) cin >> v[i]; sort(v.begin(),v.end()); for(int i=1;i<n;i++) { r+=v[i-1]; v[i]+=v[i-1]; } cout << r << end\u2026","provider_name":"Hatena Blog","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","height":"190","author_name":"a_kawashiro"}