zoukankan      html  css  js  c++  java
  • CodeForces

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

     Status

    Description

    The finalists of the "Russian Code Cup" competition in 2214 will be the participants who win in one of the elimination rounds.

    The elimination rounds are divided into main and additional. Each of the main elimination rounds consists of c problems, the winners of the round are the first n people in the rating list. Each of the additional elimination rounds consists of d problems. The winner of the additional round is one person. Besides, k winners of the past finals are invited to the finals without elimination.

    As a result of all elimination rounds at least n·m people should go to the finals. You need to organize elimination rounds in such a way, that at least n·m people go to the finals, and the total amount of used problems in all rounds is as small as possible.

    Input

    The first line contains two integers c and d (1 ≤ c, d ≤ 100) — the number of problems in the main and additional rounds, correspondingly. The second line contains two integers n and m (1 ≤ n, m ≤ 100). Finally, the third line contains an integer k (1 ≤ k ≤ 100) — the number of the pre-chosen winners.

    Output

    In the first line, print a single integer — the minimum number of problems the jury needs to prepare.

    Sample Input

    Input
    1 10
    7 2
    1
    Output
    2
    Input
    2 2
    2 1
    2
    Output
    0

    Source

    题意:有两种方案,判断一下选哪一种就行了。
    #include <iostream>
    #include <stdio.h>
    #include <stdlib.h>
    #include<string.h>
    #include<algorithm>
    #include<math.h>
    using namespace std;
    int a[200010];
     main()
    {
        int c,d,n,m,k;
        cin>>c>>d>>n>>m>>k;
        int tem=n*m-k;
        if(tem<=0){cout<<0<<endl;}
        else
        {
            if((double)c/(double)n<(double)d)
            {
                int t=tem/n,sheng=tem-t*n,hh=sheng*d;
                if(hh<c)                  cout<<c*t+hh<<endl;
                else cout<<c*t+c<<endl;
            }else
            cout<<tem*d<<endl;
        }
       return 0;
    }
  • 相关阅读:
    poj3252(组合数)
    cf-Global Round2-E. Pavel and Triangles
    cf-Global Round2-D. Frets On Fire(二分)
    cf-Global Round2-C. Ramesses and Corner Inversion(思维)
    trick
    2019ICPC南京网络赛B super_log(a的b塔次方)
    欧拉定理,欧拉降幂
    F. Moving On
    Codeforces Round #200 (Div. 1)D. Water Tree
    hdu5452
  • 原文地址:https://www.cnblogs.com/Ritchie/p/5425157.html
Copyright © 2011-2022 走看看