zoukankan      html  css  js  c++  java
  • Codeforces 215A A.Sereja and Coat Rack

    A. Sereja and Coat Rack
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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 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 <cstring>
    #include <cstdlib>
    #include <algorithm>
    int sum;
    int n,d,m;
    int map[210];
    int main()
    {
        while(~scanf("%d%d",&n,&d))
        {
            memset(map,0,sizeof(map));
            for(int i = 1;i <= n;i ++)
               scanf("%d",&map[i]);
            int temp;
            for(int i = 1; i<= n;i ++)
              for(int j = i + 1;j <= n;j ++)
              {
                  if(map[i] > map[j])
                  {
                      temp = map[i];
                      map[i] = map[j];
                      map[j] = temp;
                  }
              }
            scanf("%d",&m);
            sum = 0;
            for(int i = 1;i <= m;i ++)
            {
                if(map[i] == 0)
                  sum -= d;
                else
                  sum += map[i];
            }
            printf("%d
    ",sum);
        }
        return 0;
    }

     

  • 相关阅读:
    Java的快速失败和安全失败
    Java RMI与RPC的区别
    Java动态代理之JDK实现和CGlib实现(简单易懂)
    JVM——字节码增强技术简介
    Linux内存分配机制之伙伴系统和SLAB
    操作系统动态内存管理——malloc和free的工作机制
    Java中的Map
    Java的PriorityQueue
    Java中的List
    Java中的Set
  • 原文地址:https://www.cnblogs.com/GODLIKEING/p/3444759.html
Copyright © 2011-2022 走看看