#include <algorithm>
#include <iostream>
using namespace std;
void doit(int * X, int n)
{
auto [m,M] = minmax_element(X,X+n);
int delta = *M - *m;
if (m > M) swap(m,M);
for(++m; m != M; m++) *m = delta;
}
int main(int argc, char * argv[])
{
int X[] = {55,10,5,21,11};
doit(X,5);
for(int i: X) cout << i << " ";
}
I2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPGlvc3RyZWFtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCgp2b2lkIGRvaXQoaW50ICogWCwgaW50IG4pCnsKICAgIGF1dG8gW20sTV0gPSBtaW5tYXhfZWxlbWVudChYLFgrbik7CiAgICBpbnQgZGVsdGEgPSAqTSAtICptOwogICAgaWYgKG0gPiBNKSBzd2FwKG0sTSk7CiAgICBmb3IoKyttOyBtICE9IE07IG0rKykgKm0gPSBkZWx0YTsKfQoKaW50IG1haW4oaW50IGFyZ2MsIGNoYXIgKiBhcmd2W10pCnsKICAgIGludCBYW10gPSB7NTUsMTAsNSwyMSwxMX07CiAgICBkb2l0KFgsNSk7CiAgICBmb3IoaW50IGk6IFgpIGNvdXQgPDwgaSA8PCAiICI7Cn0KCg==