Uncowed Forces（给方法，算总分）

                     Uncowed Forces

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

SubmitStatus

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 isx, and Kevin submitted correctly at minutem 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 by50 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 integersm₁, m₂, m₃,m₄, m₅, 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 integersw₁, w₂, w₃,w₄, w₅, where w_i (0 ≤ w_i ≤ 10) is Kevin's number of wrong submissions on problem i.

The last line contains two space-separated integersh_s andh_u (0 ≤ h_s, h_u ≤ 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 in10·100 = 1000 points from hacks, his total score becomes3930 + 1000 = 4930

给出方法，算得分：

得分=.即

max(3*c[i]/10,(250-a[i])*c[i]/250-b[i]*50);

#include<stdio.h>
#include<algorithm>
#include<iostream>>
using namespace std;
int main()
{
	int a[6],b[6],m,n,sum=0;
	int c[6]={0,500,1000,1500,2000,2500};
	for(int i=1;i<=5;i++)
	scanf("%d",&a[i]);
	for(int i=1;i<=5;i++)
	scanf("%d",&b[i]);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=5;i++)
	{sum+=max(3*c[i]/10,(250-a[i])*c[i]/250-b[i]*50);
}
	sum=sum+n*100-m*50;
	printf("%d\n",sum);
	
}