Patrick and Shopping

最新推荐文章于 2022-07-31 19:50:14 发布

Ethan__Han

最新推荐文章于 2022-07-31 19:50:14 发布

阅读量304

点赞数

分类专栏：国外的oj（包括Register等）

本文链接：https://blog.csdn.net/Poseidon__ming/article/details/51983129

版权

国外的oj（包括Register等）专栏收录该内容

10 篇文章 0 订阅

订阅专栏

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

Description
Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and featured five problems with maximum point values of 500, 1000, 1500, 2000, and 2500, respectively. Despite the challenging tasks, Kevin was uncowed and bulldozed through all of them, distinguishing himself from the herd as the best cowmputer scientist in all of Bovinia. Kevin knows his submission time for each problem, the number of wrong submissions that he made on each problem, and his total numbers of successful and unsuccessful hacks. Because Codeforces scoring is complicated, Kevin wants you to write a program to compute his final score.

Codeforces scores are computed as follows: If the maximum point value of a problem is x, and Kevin submitted correctly at minute m but made w wrong submissions, then his score on that problem is . His total score is equal to the sum of his scores for each problem. In addition, Kevin’s total score gets increased by 100 points for each successful hack, but gets decreased by 50 points for each unsuccessful hack.

这里写图片描述

All arithmetic operations are performed with absolute precision and no rounding. It is guaranteed that Kevin’s final score is an integer.

Input
The first line of the input contains five space-separated integers m1, m2, m3, m4, m5, where mi (0 ≤ mi ≤ 119) is the time of Kevin’s last submission for problem i. His last submission is always correct and gets accepted.

The second line contains five space-separated integers w1, w2, w3, w4, w5, where wi (0 ≤ wi ≤ 10) is Kevin’s number of wrong submissions on problem i.

The last line contains two space-separated integers hs and hu (0 ≤ hs, hu ≤ 20), denoting the Kevin’s numbers of successful and unsuccessful hacks, respectively.

Output
Print a single integer, the value of Kevin’s final score.

Sample Input
Input
20 40 60 80 100
0 1 2 3 4
1 0
Output
4900

Input
119 119 119 119 119
0 0 0 0 0
10 0
Output
4930

Hint
In the second sample, Kevin takes 119 minutes on all of the problems. Therefore, he gets of the points on each problem. So his score from solving problems is . Adding in 10·100 = 1000 points from hacks, his total score becomes 3930 + 1000 = 4930.

此题我用了比较菜的方法，还望有大神指教，如何让更好的判断四个数的大小。
代码如下：

#include<cstdio>
#include<algorithm>
#include<string.h>
int min(int a,int b,int c,int d){
    int e,f,g;
    e=a<b?a:b;
    f=c<d?c:d;
    g=e<f?e:f;
    return g;
}
using namespace std;
int main(){
    int d1,d2,d3,a,b,c,d,m;
    while(scanf("%d%d%d",&d1,&d2,&d3)!=EOF){
        a=2*(d1+d2);  b=2*(d1+d3);
        c=2*(d3+d2);  d=d1+d2+d3;
        m=min(a,b,c,d);
        printf("%d\n",m);
    }
    return 0;
}