zoukankan      html  css  js  c++  java
  • Codeforces Round #375 (Div. 2) A

    Description

    There are three friend living on the straight line Ox in Lineland. The first friend lives at the point x1, the second friend lives at the point x2, and the third friend lives at the point x3. They plan to celebrate the New Year together, so they need to meet at one point. What is the minimum total distance they have to travel in order to meet at some point and celebrate the New Year?

    It's guaranteed that the optimal answer is always integer.

    Input

    The first line of the input contains three distinct integers x1, x2 and x3 (1 ≤ x1, x2, x3 ≤ 100) — the coordinates of the houses of the first, the second and the third friends respectively.

    Output

    Print one integer — the minimum total distance the friends need to travel in order to meet together.

    Examples
    input
    7 1 4
    output
    6
    input
    30 20 10
    output
    20
    Note

    In the first sample, friends should meet at the point 4. Thus, the first friend has to travel the distance of 3 (from the point 7 to the point 4), the second friend also has to travel the distance of 3 (from the point 1 to the point 4), while the third friend should not go anywhere because he lives at the point 4.

    题意:有三个点,选定一个点,另外两个点到它的距离最短

    解法:排序,最大的减去最小的

    #include<bits/stdc++.h>
    using namespace std;
    int main()
    {
        int a[10];
        for(int i=0;i<3;i++)
        {
            cin>>a[i];
        }
        sort(a,a+3);
        printf("%d
    ",a[1]-a[0]+a[2]-a[1]);
        return 0;
    }
    

      

  • 相关阅读:
    Android系统四层架构分享
    tracebace用法
    Hadoop生态系统入门进阶之一
    Eclipse无法显示Android设计界面解决方案
    va_start和va_end使用详解
    Android实现左右滑动效果
    Android实现网络多线程断点续传下载
    基于TCP Socket的简单网络通信
    Android通过手势实现图像拖拽功能
    SHELLEXECUTEINFO 结构详解
  • 原文地址:https://www.cnblogs.com/yinghualuowu/p/5929800.html
Copyright © 2011-2022 走看看