cf---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.

Examples
inputCopy
10 20 30
outputCopy
60
inputCopy
1 1 5
outputCopy
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.

#include<bits/stdc++.h>
using namespace std;
int main()
{
	
	int d1=0,d2=0,d3=0;
	int ans=0;
	cin>>d1>>d2>>d3;
	int min1=d1<d2?d1:d2;
	int min2=0;
	if(min1==d1)	//走d1 
	{
		min2=(d1+d2+d2)<=(d3+d2)?(d1+d2+d2):(d3+d2);
		if(min2>(d3+d3+d1))
		{
			min2=d3+d3+d1;
		}
		
	}
	else		//走d2 
	{
		min2=(d2+d1+d1)<=(d3+d1)?(d2+d1+d1):(d3+d1);
		if(min2>(d3+d3+d2))
		{
			min2=d3+d3+d2;
		}
	}
	ans=min1+min2;
	cout<<ans<<endl;
	return 0;
}

少判断了一种!!!

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值