Codeforces Round #835 (Div. 4) C. Advantage

Codeforces Round #835 (Div. 4) C. Advantage

Make a copy of the array $s$: call it $t$. Sort $t$ in non-decreasing order, so that $t_1$ is the maximum strength and $t_2$ — the second maximum strength.

Then for everyone but the best person, they should compare with the best person who has strength $t_1$. So for all $i$ such that $si$ $\ne$ $t_1$, we should output $s_i$ − $t_1.$ Otherwise, output $s_i$ − $t_2$ — the second highest strength, which is the next best person.

#include
using namespace std;

int main()
{
    int T=1;cin>>T;
    while(T--)
    {
        int n;cin>>n;
        vector<int> a(n);
        for(int i=0;i<n;i++) cin>>a[i];
        auto b=a;
        sort(b.begin(),b.end());
        for(int i=0;i<n;i++)
        {
            if(a[i]==b[n-1]) cout<<a[i]-b[n-2]<<" ";
            else cout<<a[i]-b[n-1]<<" ";
        }
        cout<<endl;
    }
    return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22