交叉排序

#include <iostream>
#include <algorithm>
using namespace std;

int a[100010];
bool compare(int a,int b){
    return a>b;
}
int main()
{
   int N,l1,r1,l2,r2;
   cin>>N>>l1>>r1>>l2>>r2;
   for(int i = 1;i <= N;i++){
    cin>>a[i];
   }
   sort(a+l1,a+r1+1);
   sort(a+l2,a+r2+1,compare);
   for(int i = 1;i<=N;i++){
    if(i == N) cout<<a[i];
    else cout<<a[i]<<" ";
   }
    return 0;
}