891B - Gluttony - CodeForces Solution

#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cmath>


using  namespace  std;


pair<int,int> a[100];
int b[100];

bool cmp(pair<int,int> a,pair<int,int> b)
{
    return a.first>b.first;
}

int main()
{
    int n;
    cin>>n;
    for (int i=0;i<n;i++)
    {
        cin>>a[i].first;
        a[i].second=i;
    }
    sort(a,a+n,cmp);
    for (int i=0;i<n-1;i++)
    {
        int pos=a[i+1].second;
        b[pos]=a[i].first;
    }
    b[a[0].second]=a[n-1].first;
    
    for (int i=0;i<n;i++)
    {
        cout<<b[i]<<" ";
    }

    return 0;
}