[Codeforces] Sereja and Coat Rack

http://codeforces.com/problemset/problem/368/A

足以秒杀的一道题.

#include <cstdio>
#include <algorithm>
using namespace std;

int a[110] = {0};

int main()
{
    int n = 0, d = 0;
    scanf("%d%d", &n, &d);
    for (int i = 0; i < n; ++i) {
        scanf("%d", &a[i]);
    }
    int m = 0;
    scanf("%d", &m);
    int re = 0;
    sort(a, a + n);
    int t = 0;
    if (m < n) {
        t = m;
    } else {
        t = n;
        re -= d * (m - n);
    }
    for (int i = 0; i < t; ++i) {
        re += a[i];
    }
    printf("%d\n", re);
    return 0;
}