Patrick and Shopping
来源:互联网 发布:抓取淘宝商品 编辑:程序博客网 时间:2024/06/07 03:36
Description
Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, Patrick needs to buy some goodies in two stores located near his house. There is ad1 meter long road between his house and the first shop and ad2 meter long road between his house and the second shop. Also, there is a road of lengthd3 directly connecting these two shops to each other. Help Patrick calculate the minimum distance that he needs to walk in order to go to both shops and return to his house.
Patrick always starts at his house. He should visit both shops moving only along the three existing roads and return back to his house. He doesn't mind visiting the same shop or passing the same road multiple times. The only goal is to minimize the total distance traveled.
Input
The first line of the input contains three integers d1,d2, d3 (1 ≤ d1, d2, d3 ≤ 108) — the lengths of the paths.
- d1 is the length of the path connecting Patrick's house and the first shop;
- d2 is the length of the path connecting Patrick's house and the second shop;
- d3 is the length of the path connecting both shops.
Output
Print the minimum distance that Patrick will have to walk in order to visit both shops and return to his house.
Sample Input
10 20 30
60
1 1 5
4
Hint
The first sample is shown on the picture in the problem statement. One of the optimal routes is: house first shop second shop house.
In the second sample one of the optimal routes is: house first shop house second shop house.
题意:你从家出发去两个商店买东西,你家和两个商店之间,以及两个商店之间分别有一条路,现在要求你走的最短的路程
思路:你一共有四种选择:d1+d2+d3,d1*2+d2*2,d1*2+2*d3,d2*2+d3*2;求出其中最小的就可以了。
#include<stdio.h>#include<algorithm>using namespace std;int main(){ int d1,d2,d3; while(~scanf("%d%d%d",&d1,&d2,&d3)) { int ans=d1+d2+d3; ans=min(ans,d1*2+d2*2); ans = min (ans,d1*2+2*d3); ans = min(ans,d2*2+d3*2); printf("%d\n",ans); } return 0;}
- A. Patrick and Shopping
- Patrick and Shopping(水题)
- Patrick and Shopping
- 【coderorces】Patrick and Shopping
- Patrick and Shopping
- Patrick and Shopping
- Patrick and Shopping
- C - Patrick and Shopping
- Patrick and Shopping
- 【codeforces】Patrick and Shopping
- Patrick and Shopping
- Patrick and Shopping
- Patrick and Shopping(模拟)
- 599A Patrick and Shopping
- CF-332-div2-A. Patrick and Shopping
- Codeforces 599A Patrick and Shopping 【水题】
- Codeforces 599 A. Patrick and Shopping
- CodeForces 599A Patrick and Shopping
- 分布式事务理论原理与实践分析
- 超时时间已到。超时时间已到,但是尚未从池中获取连接。出现这种情况可能是因为所有池连接均在使用,并且达到了最大池大小。
- 关于apache代理报错error reading status line from remote server
- CentOS7 Puppet安装脚本小结
- 在一个jsp页面引用另一个jsp页面的方式
- Patrick and Shopping
- Main Note - Oracle GoldenGate - Supplemental Logging
- 64位Win7下用VS2010编译OpenSSL
- iOS UITableView(十四) 设置TbleviewController的滚动范围
- 【网络流之最小割模型】poj3469 BZOJ3144 UVA1212
- Java WebSocket实现网络聊天室(群聊+私聊)
- unity初学(基本的方法)
- 详解 PHP 的引用
- NSUserDefaults -- 写读&配置