CodeForces

---

题目连接：http://codeforces.com/problemset/problem/723/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.

校队里有三位大佬，不仅代码写的好，更是各种不可描述的交易样样精通~正好他们仨都住在同一条街上，但都不在同一个位置。为了方便 py交易 学习交流，他们决定在这条街上的某一点汇合。由于大佬们都比较懒，他们决定让你帮他们选择这个汇合点，使得三人需要移动的总距离最短。

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.

输入三个不同的数 x1, x2 ，x3 (1 ≤ x1, x2, x3 ≤ 100)—分别代表三位大佬在这条街上的坐标

Output

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

输出三人最短需要移动的总距离

Sample Input

7 1 4

Sample Output

6

Sample Input

30 20 10

Sample Output

20

解题思路

因为是在一条路上， 所以先排序，中间的那个人不动，两边的人忘他家走就是最短路程

AC代码

#include<iostream>#include<algorithm>using namespace std;int main () {    int a[4];    for(int i = 0; i <= 2; i++) cin >> a[i];    sort(a, a+3);    printf("%d\n", a[2]-a[0]);    return 0;}