A. Restoring Three Numbers

题目链接：https://codeforces.com/contest/1154/problem/A
A. Restoring Three Numbers
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Polycarp has guessed three positive integers a, b and c. He keeps these numbers in secret, but he writes down four numbers on a board in arbitrary order — their pairwise sums (three numbers) and sum of all three numbers (one number). So, there are four numbers on a board in random order: a+b, a+c, b+c and a+b+c.

You have to guess three numbers a, b and c using given numbers. Print three guessed integers in any order.

Pay attention that some given numbers a, b and c can be equal (it is also possible that a=b=c).
Input
The only line of the input contains four positive integers x1,x2,x3,x4 (2≤xi≤109) — numbers written on a board in random order. It is guaranteed that the answer exists for the given number x1,x2,x3,x4.

Output
Print such positive integers a, b and c that four numbers written on a board are values a+b, a+c, b+c and a+b+c written in some order. Print a, b and c in any order. If there are several answers, you can print any. It is guaranteed that the answer exists.

Examples
input
3 6 5 4
output
2 1 3
input
40 40 40 60
outputCopy
20 20 20
input
201 101 101 200
output
1 100 100

题意：
给你四个数，让你找出三个数a,b,c满足a+b,a+c,b+c,a+b+c,这个四个值就是给出的那四个数；
解题思路：排序，直接用最大的减去最小，次小，次次小，得出的三个数任意输出就可以（这个是codefoces的特性）

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