{"blog_title":"\u5b87\u5b99\u30c4\u30a4\u30c3\u30bf\u30e9\u30fcX\u306e\u6182\u9b31","provider_url":"https://hatena.blog","title":"RUPC 2016 Day1 D: Scanner","provider_name":"Hatena Blog","type":"rich","published":"2016-03-07 04:03:11","url":"https://kenkoooo.hatenablog.com/entry/2016/03/07/040311","width":"100%","image_url":null,"author_url":"https://blog.hatena.ne.jp/kenkoooo/","version":"1.0","blog_url":"https://kenkoooo.hatenablog.com/","height":"190","description":"\u554f\u984c AIZU ONLINE JUDGE \u89e3\u6cd5 \u611a\u76f4DP \u30b3\u30fc\u30c9 #include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { cin.tie(0); ios::sync_with_stdio(false); ll N; cin >> N; vector<int> T(N); T.resize(N); for (int i = 0; i < N; ++i) cin >> T[i]; sort(T.begin(), T.end()); int sum = accumulate(T.begin(),\u2026","categories":["AOJ","\u7af6\u6280\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0","\u8981\u5fa9\u7fd2"],"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkenkoooo.hatenablog.com%2Fentry%2F2016%2F03%2F07%2F040311\" title=\"RUPC 2016 Day1 D: Scanner - \u5b87\u5b99\u30c4\u30a4\u30c3\u30bf\u30e9\u30fcX\u306e\u6182\u9b31\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_name":"kenkoooo"}