Submission #865603

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring> 
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
 
using namespace std;
 
#define pai 3.14159265359
#define mod 1000000007

int main()
{
    int n, x;
    cin >> n >> x;
    int a[2001];
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    sort(a + 1, a + n + 1);
    long long int result[2001] = {};
    for(int i = 1; i <= n; i++){
        result[i] = result[i - 1] + min(x + a[1], a[i]);
    }
    cout << result[n] << endl;
    return 0;
}

Submission Info

Judge Result