hdu 3866 Moonfang's Birthday

/*
关键：对存放num和money的节点进行二级排序 
原文：“If there is still ambiguity,
 those who come first in the list pay more.” 
*/
#define LOCAL
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<iomanip>
#include<string>
#include<algorithm>
#include<ctime>
#define N 10005
using namespace std;
typedef struct 
{
    int num,money;    
}Node;
Node pay[N]; 
int moneycmp(const void *p,const void *q)
{
     if(((Node *)p)->money==((Node *)q)->money)
         return ((Node *)q)->num-((Node *)p)->num;
     return ((Node *)p)->money-((Node *)q)->money;    
}
//关键点：由于总体是按money升序排列的，而money相同时先到者要多付
//按照这个思想多付者因该排到后头，故应该按num的降序排列 
int numcmp(const void *p,const void *q)
{
     return ((Node *)p)->num-((Node *)q)->num;    
}
int main()
{
#ifdef LOCAL
       freopen("input.txt","r",stdin);
       freopen("output.txt","w",stdout);
#endif

    int m,n,sum,i,ave;
    cin>>m;
    while(m--)
    {
             cin>>sum>>n;
             for(i=0;i<n;i++)
             {cin>>pay[i].money;pay[i].num=i;}
             qsort(pay,n,sizeof(Node),moneycmp);
             ave=sum/n;
             for(i=0;i<n-1;i++)
             {
                   if(pay[i].money<ave)
                   {sum-=pay[i].money;ave=sum/(n-i-1);}
                   else if(pay[i].money>ave)
                   {pay[i].money=ave;sum-=ave;ave=sum/(n-i-1);}
                   else{sum-=ave;ave=sum/(n-i-1);}       
             }
             if(sum>pay[n-1].money)
             { cout<<"IMPOSSIBLE"<<endl;continue;}
             else if(sum<pay[n-1].money) pay[n-1].money=sum;
             qsort(pay,n,sizeof(Node),numcmp);
             cout<<pay[0].money;
             for(i=1;i<n;i++)
                 cout<<" "<<pay[i].money;
             cout<<endl;
    }
    return 0;
}