multiset Minimum Array CodeForces - 1157E

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#define ll long long
#define inf 0x3f3f3f3f

using namespace std;
const int N=2e5+5;
int n,a[N],x;

int main()
{
    multiset<int> s;
    cin >> n;
    for(int i=0;i<n;i++)
        cin >> a[i];
    for(int i=0;i<n;i++)
        cin >> x,s.insert(x);
    multiset<int>::iterator it;
    for(int i=0;i<n;i++)
    {
        int y=n-a[i];
        it=s.lower_bound(y);
        if(it==s.end())
            it=s.begin();
        printf("%d ",(*it+a[i])%n);
        s.erase(it);
    }
    printf("\n");
    return 0;
}