Codeforces Round #215 (Div. 2) A. Sereja and Coat Rack-优快云博客

本文探讨了一个关于餐厅衣帽架使用与罚款计算的问题。通过算法解决如何最大化利润，考虑到顾客选择最低价挂钩及Sereja支付罚款的情况。文章提供了C++代码实现，包括输入处理、排序及计算总利润。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Sereja owns a restaurant for n people. The restaurant hall has a coat rack with n hooks. Each restaurant visitor can use a hook to hang his clothes on it. Using the i-th hook costs a_i rubles. Only one person can hang clothes on one hook.

Tonight Sereja expects m guests in the restaurant. Naturally, each guest wants to hang his clothes on an available hook with minimum price (if there are multiple such hooks, he chooses any of them). However if the moment a guest arrives the rack has no available hooks, Sereja must pay a d ruble fine to the guest.

Help Sereja find out the profit in rubles (possibly negative) that he will get tonight. You can assume that before the guests arrive, all hooks on the rack are available, all guests come at different time, nobody besides the m guests is visiting Sereja's restaurant tonight.

Input

The first line contains two integers n and d (1 ≤ n, d ≤ 100). The next line contains integers a₁, a₂, ...,a_n (1 ≤ a_i ≤ 100). The third line contains integer m (1 ≤ m ≤ 100).

Output

In a single line print a single integer — the answer to the problem.

Sample test(s)
input
2 1
2 1
2
output
3
input
2 1
2 1
10
output
-5

Note

In the first test both hooks will be used, so Sereja gets 1 + 2 = 3 rubles.

In the second test both hooks will be used but Sereja pays a fine 8 times, so the answer is 3 - 8 = - 5.

好久没刷题了，一道简单的排序题

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

const int maxn=110;
int a[maxn],n,m,d;

int main(){
    while(scanf("%d%d",&n,&d)!=EOF){
         int sum=0,ans=0;
         for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
            sum+=a[i];
         }
         scanf("%d",&m);
         if(m>=n){
             ans=sum-(m-n)*d;
         }else{
             sort(a,a+n);
             for(int i=0;i<m;i++) ans+=a[i];
         }
         cout<<ans<<endl;
    }
    return 0;
}

转载于:https://www.cnblogs.com/riasky/p/3473057.html