zoukankan      html  css  js  c++  java
  • Sereja and Coat Rack(水)

    Sereja and Coat Rack
    Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

    Description

    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 ai 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 a1, a2, ..., an(1 ≤ ai ≤ 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 Input

    Input
    2 1 2 1 2
    Output
    3
    Input
    2 1 2 1 10
    Output
    -5

    Hint

    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.

    题意:顾客挂衣服,每个称子可以挂一个衣服,每个钩子挂衣服所需要的价格不同,宾客会选便宜的 挂,钩子不够了房东要陪d元,现在有m个顾客,让求今晚房东收益;

    代码:

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cmath>
    #include<algorithm>
    using namespace std;
    class clothes{
        public:
            int n,d,m;
            int a[110];
            clothes(int n,int d):n(n),d(d){
                for(int i = 0; i < n; i++){
                    cin >> a[i];
                }
                cin >> m;
            }
            int work(){
                sort(a,a + n);
                for(int i = n; i < m; i++)
                    a[i] = -d;
                int ans = 0;
                for(int i = 0; i < m; i++)
                    ans += a[i];
                return ans;
            }
    };
    int main(){
        int n,d;
        while(~scanf("%d%d", &n, &d)){
            clothes _guest(n,d);
            cout << _guest.work() << endl;
        }
        return 0;
    }
  • 相关阅读:
    如何为惠普笔记本ProBook 4431S清理电源风扇通风口灰尘
    office app之 Mail App 从新建到发布
    sublime_text3汉化,破解,安装Package_control支持中文显示
    poj3126prime+BFS
    android开发之欢迎界面
    poj 1151 离散化
    DbVisualizer 9 解决中文乱码问题
    RS232、RS422与RS485串口标准简介
    动态创建菜单和动态关联菜单项事件
    更改路径
  • 原文地址:https://www.cnblogs.com/handsomecui/p/5343708.html
Copyright © 2011-2022 走看看