Patrick and Shopping(模拟)

原创 2015年11月21日 10:05:48
                                                                                                           A. Patrick and Shopping

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 a d1 meter long road between his house and the first shop and a d2 meter long road between his house and the second shop. Also, there is a road of length d3 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 test(s)
Input
10 20 30
Output
60
Input
1 1 5
Output
4
Note

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.



AC代码:


#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<cmath>
using namespace std;
#define CRL(a) memset(a,0,sizeof(a))
typedef __int64 ll;
#define T 200005
#define mod 1000000007
int main()
{
#ifdef zsc
    freopen("input.txt","r",stdin);
#endif
	int s1,s2,s3;
	while(~scanf("%d%d%d",&s1,&s2,&s3))
	{
		int t1=2*(s1+s2),t2=(s1+s2+s3);
		t1 = min(t1,t2);
		int t3=2*(s2+s3),t4=2*(s1+s3);
		t3=min(t3,t4);
		printf("%d\n",min(t1,t3));
	}
	return 0;
}


版权声明:本文为博主原创文章,转载必须声明出处,thank。

相关文章推荐

hpu暑假训练C - Patrick and Shopping 【思维】&&【水题】

Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, Patrick needs t...

Codeforces Round #332 (Div. 2) A. Patrick and Shopping

A. Patrick and Shopping time limit per test 1 second memory limit per test 256 megabytes...

【Codeforces Round 332 (Div 2)A】【水题】A. Patrick and Shopping 遍历三元环的最小成本

A. Patrick and Shopping time limit per test 1 second memory limit per test 256 megabytes...

Patrick and Shopping

Description Today Patrick waits for a visit from his friend Spongebob. To prepare for the visit, ...

CodeForces - 665B Shopping(模拟)

题目: B. Shopping time limit per test 1 second memory limit per test 256 megabytes ...

usaco shopping offers 解析 and C 语言实现

题意:现在商场正在打折,打折的方式是同时买规定的的物品会比分开买便宜,现在告诉你打折的方式和要买的物品,求最少的钱,有个条件是不可以多买物品。 本题是典型的动态规划,对于动态规划...

Patrick’s blog is online now!

Patrick’s blog is online now!

Future-of-Spark-Patrick-Wendell

  • 2015-09-22 16:40
  • 312KB
  • 下载
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)