Codeforces Round #251 (Div. 2) B. Devu, the Dumb Guy
2014-06-08 22:59
316 查看
注意数据范围即可
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main(){ long long n,x; cin >> n >> x; vector<long long> c(n); for(int i = 0 ; i < n; ++ i) cin >> c[i]; sort(c.begin(),c.end()); long long res = 0; for(int i = 0 ; i < n; ++ i){ res +=c[i]*(x> 1 ? x--: 1); } cout<<res<<endl; }
相关文章推荐
- B. Devu, the Dumb Guy
- Devu, the Dumb Guy
- Codeforces 439 B. Devu, the Dumb Guy
- Codeforces Round #251(Div. 2) 439B. Devu, the Dumb Guy 贪心
- CodeForces 439B Devu, the Dumb Guy
- Codeforces Round #251 (Div. 2) 439B Devu, the Dumb Guy(贪心)
- Codeforces 439B Devu, the Dumb Guy
- Codeforces 439B Devu, the Dumb Guy
- Codeforces Round #251 (Div. 2) A - Devu, the Singer and Churu, the Joker
- Codeforces 439B Devu, the Dumb Guy(贪心)
- Codeforces Round #251 (Div. 2) C Devu and Partitioning of the Array
- Codeforces Round #251 (Div. 2) C. Devu and Partitioning of the Array
- codeforces 251 div2 C. Devu and Partitioning of the Array 模拟
- CodeForces 439B Devu, the Dumb Guy
- Codeforces Round #249 (Div. 2)C Devu and Partitioning of the Array
- Codeforces Round #249 (Div. 2)C Devu and Partitioning of the Array
- Codeforces Round #251 (Div. 2) C. Devu and Partitioning of the Array
- Codeforces Round #251(Div. 2) 439C. Devu and Partitioning of the Array 构造
- Codeforces Round #250 (Div. 1) B. The Child and Zoo 并查集
- Codeforces Round #258 (Div. 2)Devu and Flowers 容斥原理