codeforces 1041 c 乱搞

 #include <bits/stdc++.h>

 using namespace std;

 struct po {
     int val;
     int id;
 };
 po a[];
 vector<int> ans[];
 map<int,int> mp;
 struct node {
     int val;
     int wh;
     node(int _val,int _wh) {
         val = _val;
         wh = _wh;
     }
     bool operator < (const node &b) const {
         return val > b.val;
     }
 };

 bool cmp1(po x,po y) {
     return x.val < y.val;
 }
 bool cmp2(po x,po y) {
     return x.id < y.id;
 }
 int main() {

     int n,m,d;

     scanf("%d %d %d",&n,&m,&d);

     for(int i = ; i <= n; i++) {
         scanf("%d",&a[i].val);
         a[i].id = i;
     }

     sort(a + ,a + n + ,cmp1);

     priority_queue<node> q;

     q.push(node(a[].val,));
     ans[].push_back(a[].val);
     int cnt = ;
     for(int i = ; i <= n; i++) {

         if(a[i].val - d > q.top().val) {
             ans[q.top().wh].push_back(a[i].val);
             q.push(node(a[i].val,q.top().wh));
             q.pop();
         }
         else {
             q.push(node(a[i].val,++cnt));
             ans[cnt].push_back(a[i].val);
         }
     }

     printf("%d\n",cnt);
     for(int i = ; i <= cnt; i++) {
         for(int j = ; j < ans[i].size(); j++) {
             mp[ans[i][j]] = i;
         }
     }

     sort(a + ,a + n + ,cmp2);

     for(int i = ; i <= n; i++) {
         printf("%d ",mp[a[i].val]);
     }

     return ;
 }