ZCMU-1309-Vasya and Public Transport
来源:互联网 发布:淘宝开放平台接口 编辑:程序博客网 时间:2024/05/09 21:14
1309: Vasya and Public Transport
Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 42 Solved: 28
[Submit][Status][Web Board]
Description
Vasya often uses public transport. The transport in the city is of two types: trolleys and buses. The city has n buses and m trolleys, the buses are numbered by integers from 1 to n, the trolleys are numbered by integers from 1 to m.
Public transport is not free. There are 4 types of tickets:
1.A ticket for one ride on some bus or trolley. It costs c1 burles;
2. A ticket for an unlimited number of rides on some bus or on some trolley. It costs c2 burles;
3.A ticket for an unlimited number of rides on all buses or all trolleys. It costs c3 burles;
4.A ticket for an unlimited number of rides on all buses and trolleys. It costs c4 burles.
Vasya knows for sure the number of rides he is going to make and the transport he is going to use. He asked you for help to find the minimum sum of burles he will have to spend on the tickets.
Input
The first line contains four integers c1, c2, c3, c4 (1 ≤ c1, c2, c3, c4 ≤ 1000) — the costs of the tickets.
The second line contains two integers n and m (1 ≤ n, m ≤ 1000) — the number of buses and trolleys Vasya is going to use.
The third line contains n integers ai (0 ≤ ai ≤ 1000) — the number of times Vasya is going to use the bus number i.
The fourth line contains m integers bi (0 ≤ bi ≤ 1000) — the number of times Vasya is going to use the trolley number i.
Output
Print a single number — the minimum sum of burles Vasya will have to spend on the tickets.
Sample Input
Sample Output
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int main(){ int a,b,c,d,i,p; while(~scanf("%d%d%d%d",&a,&b,&c,&d)) { int n,m,sum,sum1; sum=0; sum1=0; scanf("%d%d",&n,&m); for(i=0;i<n;i++) { scanf("%d",&p); sum+=min(a*p,b);//第一种方案和第二种方案比较 } for(i=0;i<m;i++) { scanf("%d",&p); sum1+=min(a*p,b);//第一种方案和第二种方案比较 } sum=min(sum,c);//求出和第三种方案比较的最小值 sum1=min(sum1,c); sum=min(sum+sum1,d);//和最后一个方案比较的最小值 printf("%d\n",sum); }return 0;}
- ZCMU-1309-Vasya and Public Transport
- Vasya and Public Transport
- B. Vasya and Public Transport
- B. Vasya and Public Transport
- codeforces 355B Vasya and Public Transport
- Codeforces Round #206 (Div. 2) B. Vasya and Public Transport
- Codeforces_355B_Vasya and Public Transport(贪心)
- Vasya and Digital Root
- Vasya and Robot
- C. Vasya and Robot
- Vasya and the Bus
- Vasya and the Bus
- A. Vasya and Socks
- A. Vasya and Socks
- CF493B Vasya and Wrestling
- A. Vasya and Football
- A Vasya and Football
- B. Vasya and Wrestling
- Swing窗体创建
- Linux中最受欢迎的邮件传输代理详解
- 详解line-height与vertical-algin
- 电机运行工作制
- 图的邻接表实现
- ZCMU-1309-Vasya and Public Transport
- 并发多线程之死锁-----哲学家吃饭问题
- 在win10上的IIS发布网站问题集锦
- storm四之storm的工作流程
- A1070. Mooncake (25)
- 雪碧图(CSS SPIRIT)简介
- javascript基础:函数传递参数的方式、参数数组、变量范围(变量作用域)
- [LeetCode]410. Split Array Largest Sum
- Linux文件系统和底层驱动的笔记