cf B. Vasya and Public Transport

http://codeforces.com/contest/355/problem/B

 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 using namespace std;
 int a[],b[];
 int c1,c2,c3,c4;
 int n,m;
 int main()
 {
     while(scanf("%d%d%d%d",&c1,&c2,&c3,&c4)!=EOF)
     {
         scanf("%d%d",&n,&m);
         for(int i=; i<=n; i++)
         {
             scanf("%d",&a[i]);
         }
         for(int i=; i<=m; i++)
         {
             scanf("%d",&b[i]);
         }
         int sum=;
         for(int i=; i<=n; i++)
         {
             sum+=min(a[i]*c1,c2);
         }
         if(sum>c3)
         {
             sum=c3;
         }
         int sum1=;
         for(int i=; i<=m; i++)
         {
             sum1+=min(b[i]*c1,c2);
         }
         if(sum1>c3)
         {
             sum1=c3;
         }
         int ans=sum1+sum;
         if(sum1+sum>c4)
         {
             ans=c4;
         }
         printf("%d\n",ans);
     }
     return ;
 }