Uncowed Forces

题意翻译

## **题目描述** 凯文刚刚完成了 CF 的比赛。测试时间为 120 分钟，有 5 个题目。题目 1~5 的满分分别是: 500、1000、1500、2000 和 2500。他作答了所有的题。 他知道自己每个问题的提交时间、每个问题上他提交错误的次数，以及它提交正确和错误的总数。 但 CF 评分的机制很复杂， 凯文想知道他的最终得分。 评分机制：设一个问题的最高分是 x ,提交者在第 m 分钟时提交正确，提交者错误提交了 w 此。那么，他的每道题的得分是：  他的总成绩是他每道题成绩的和。此外，凯文每通过一道题，他的总分数将增加 100 ；反之，他每错误一次，他的总分数将减少 50 分。 所有运算都是觉得准确的，没有四舍五入。凯文的得分绝对是整数。 ## 输入格式 第一行分别是：m1 , m2 , m3 , m4 , m5 。 第二行分别是：w1 , w2 , w3 , w4 , w5。 第三行有两个数：凯文的正确总数和错误总数。 ## 输出格式 打印一个整数，既凯文的最终得分。

题目描述

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.

输入输出格式

输入格式

The first line of the input contains five space-separated integers $ m_{1} $ , $ m_{2} $ , $ m_{3} $ , $ m_{4} $ , $ m_{5} $ , where $ m_{i} $ ( $ 0<=m_{i}<=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 $ w_{1} $ , $ w_{2} $ , $ w_{3} $ , $ w_{4} $ , $ w_{5} $ , where $ w_{i} $ ( $ 0<=w_{i}<=10 $ ) is Kevin's number of wrong submissions on problem $ i $ . The last line contains two space-separated integers $ h_{s} $ and $ h_{u} $ ( $ 0<=h_{s},h_{u}<=20 $ ), denoting the Kevin's numbers of successful and unsuccessful hacks, respectively.

输出格式

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

输入输出样例

输入样例 #1

20 40 60 80 100
0 1 2 3 4
1 0

输出样例 #1

4900

输入样例 #2

119 119 119 119 119
0 0 0 0 0
10 0

输出样例 #2

4930

说明

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 $ .