水到家了
#include <iostream>
#include <vector>
#include <algorithm> using namespace std; struct Point{
int index, pos;
Point(int index_ = , int pos_ = ){
index = index_;
pos = pos_;
} bool operator < (const Point& a) const{
return pos < a.pos;
}
}; int main(){
int n,m, l,r;
cin >> n >> m;
vector<Point> points(n);
for(int i = ; i < n ; ++ i){
cin >> points[i].pos;
points[i].index = i;
}
sort(points.begin(),points.end());
for(int i = ; i < m; ++ i) cin >> l >> r;
vector<int> res(n,);
for(int i = ; i < n ; ++ i ){
if(i% == ) res[points[i].index] =;
}
cout<<res[];
for(int i = ; i <n ; ++ i ) cout<<" "<<res[i];
cout<<endl; }