NYOJ 344 Moonfang's Birthday

描述

It's Moonfang's birthday,and his friends decided to buy him a copy of XianJianQiXiaZhuan V.

Since some of friends have more money available than others, nobody has to pay more than he can afford. Every contribution will be a multiple of 1 cent,i.e.,nobody can pay fractions of a cent.

Everybody writes down the maxumum amount he is able to contribute. Taking into account these maximum amounts from everybody, your task is to share the cost of the present as fairly as possible. That means, you minimize the largest distance of the contributions to 1/n-th of the total cost.

In case of a tie, minimize the second largest distance, and so on. Since the smallest unit of contribution is 1 cent, there might be more than one possible division of the cost. In that case, persons with a higher maximum amount pay more. If there is still ambiguity, those who come first in the list pay more.

Since you bought the present, it is your task to figure out how much everybody has to pay.

输入On the first line a positive integer: the number of test cases, at most 200. After that per test case:
• One line with two integers p and n: the price of the present in cents (1 ≤ p ≤ 1 000 000) and the number of people (2 ≤ n ≤ 10000) who contribute to the present (including you).
• One line with n integers ai (1 ≤ ai ≤ 1 000 000), where ai is the maximum amount, in cents, that the i-th person on the list is able to contribute.
输出Per test case:
• One line with n integers: the amounts each person has to contribute according to the scheme. If the total cost cannot be divided according to the above rules, the line must contain "IMPOSSIBLE" instead.
样例输入

3 
20 4 
10 10 4 4 
7 3 
1 1 4 
34 5 
9 8 9 9 4

样例输出

6 6 4 4 

IMPOSSIBLE 

8 7 8 7 4 

看的别人给出的思路，：注意二级排序。从钱少的开始，如果他的钱数大于 p/n，则他就出p/n块大洋，否则就全出。然后n-1;重新算平均值(p/n)。

最后，如果p>0，就输出IMPOSSIBLE

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedefstruct
{
    intv;                 //拥有的钱
    ints;                 //位置
 
}site;
 
intcomp (constvoid*a,constvoid*b )
{
    site x= *(site *)a;
    site y= *(site *)b;
    if(x.v!=y.v)
        returnx.v-y.v;
    returny.s-x.s;
 
}
 
 
site xjq[10005];
intsum[10005];        //记录每个人出钱的多少
intmain()
{
    intt;
    inti;
    intp,n;
    intk;
     
    scanf("%d",&t);
    while(t--)
    {
 
        memset(xjq,0,sizeof(xjq));
        memset(sum,0,sizeof(sum));
        scanf("%d%d",&p,&n);
 
 
 
        for(i=0;i<n;i++)
        {
            scanf("%d",&xjq[i].v);
            xjq[i].s=i;
 
        }
        qsort(xjq,n,sizeof(site),comp);            //升序,二级排序
        k=n;
        for(i=0;i<n;i++)
        {
            if(xjq[i].v<=p/k)       
                sum[xjq[i].s]=xjq[i].v;
 
            else   
 
                sum[xjq[i].s]=p/k;
            k--;
            p-=sum[xjq[i].s];
 
        }
 
        if(p>0)
            printf("IMPOSSIBLE");
        else
        {
             
            for(i=0;i<n;i++)
                printf("%d ",sum[i]);
 
        }
        printf("\n");
             
    }
    return0;
}