Moonfang's Birthday&&2011 Multi-University Training Contest 3 - Host by BIT

#include<iostream>
#define N 10001
#include<algorithm>
#include<string.h>
using namespace std;
typedef struct
{  int val;
int id;
int w;
}Node;
Node s
;
bool cmp1(const Node& a,const Node& b)
{ if(a.val!=b.val) return a.val<b.val;
else    return a.id>b.id;
}
bool cmp(const Node& a,const Node& b)
{return a.id<b.id;}
int main()
{ int Case;
cin>>Case;
while(Case--)
{ int n,m;
cin>>n>>m;
int sum=0;
for(int i=0;i!=m;++i)
{   cin>>s[i].val;
sum+=s[i].val;
s[i].id=i;
}
if(sum<n) {cout<<"IMPOSSIBLE"<<endl;continue;}
sort(s,s+m,cmp1);
sum=n;
for(int i=0;i<m;++i)
{ s[i].w=min(s[i].val,sum/(m-i));
sum-=s[i].w;
}
sort(s,s+m,cmp);
for(int i=0;i<m-1;++i)
cout<<s[i].w<<" ";
cout<<s[m-1].w<<endl;
}return 0;
}