E. Minimum Array(思维+贪心)

https://codeforces.com/problemset/problem/1157/E

---

思路:

对于一个数a[i],如果当前能找到n-a[i]是最好的。如果找不到，那么从这个数往后找第一个大于等于的。再找不到就返回首元素。

所以用二分来实现，至于这个sort和去除元素，用multiset实现

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],b[maxn],tot=0;
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;cin>>n;
  for(LL i=1;i<=n;i++) cin>>a[i];
  multiset<LL>s;
  for(LL i=1;i<=n;i++){
    LL x;cin>>x;
    s.insert(x);
  }
  for(LL i=1;i<=n;i++){
     LL x=n-a[i];
     multiset<LL>::iterator it;
     it=s.lower_bound(x);
     //debug(*it);
     if(it==s.end()){
        it=s.begin();
        b[++tot]=(a[i]+(*it))%n;
        s.erase(it);
     }
     else{
        b[++tot]=(a[i]+(*it) )%n;
        s.erase(it);
     }
  }
  for(LL i=1;i<=tot;i++){
    cout<<b[i]<<" ";
  }
  cout<<"\n";
return 0;
}