zoukankan      html  css  js  c++  java
  • codeforces 599A Patrick and Shopping

    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.

     1 #include<cstdio>
     2 #include<algorithm>
     3 using namespace std;
     4 int main()
     5 {
     6     int d1,d2,d3;
     7     int ans;
     8     scanf("%d%d%d",&d1,&d2,&d3);
     9     ans=d1+d2+d3,ans=min(ans,2*d1+2*d2),ans=min(ans,2*d2+2*d3),ans=min(ans,2*d1+2*d3);
    10     printf("%d
    ",ans);
    11     return 0;
    12 }
  • 相关阅读:
    DNS域名解析抓包分析
    Redis实现分布式锁
    Redis内存回收淘汰策略
    Redis缓存雪崩、击穿、穿透
    Redis内存碎片
    C++ 友元
    C++ const
    C++构造函数与析构函数调用虚函数
    C++类成员变量的初始化顺序
    C++ 类对象和类指针
  • 原文地址:https://www.cnblogs.com/homura/p/4988090.html
Copyright © 2011-2022 走看看