TJU Exercise Contest 2011(7) A题
来源:互联网 发布:知乎课程 编辑:程序博客网 时间:2024/06/05 06:03
A. Fair Divisionhttp://59.67.33.130/toj/contest/showp160_A.html#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;struct Node
{
int num;
int max;
int fin;
}stu[101];bool cmp(Node a,Node b)
{
if(a.max>b.max)
return true;
else if(a.max==b.max&&a.num<b.num)
return true;
else return false;
}int main()
{
int t;
cin>>t;
while(t--)
{
int p,n;
cin>>p>>n;
int i,j,k;
int sum=0;
for(i=0;i<n;i++)
{
stu[i].num=i;
cin>>stu[i].max;
sum+=stu[i].max;
}
if(sum<p)
{
cout<<"IMPOSSIBLE"<<endl;
continue;
}
//еепР
sort(stu,stu+n,cmp);
//for(i=0;i<n;i++)
//printf("stu[%d].num=%d .max=%d/n",i,stu[i].num,stu[i].max); int aver=0;
int temp=n-1; while(temp>=0)
{
if(p%(temp+1)==0)
aver=p/(temp+1);
else aver=p/(temp+1);
//printf("p=%d/n",p);
//printf("aver=%d/n",aver);
//printf("temp=%d/n",temp);
//printf("stu[%d].num=%d/n",temp,stu[temp].num);
if(aver<=stu[temp].max)
{
stu[stu[temp].num].fin=aver;
p-=aver;
temp--;
}
else {
stu[stu[temp].num].fin=stu[temp].max;
p-=stu[temp].max;
temp--;
}
}
for(i=0;i<n-1;i++)
printf("%d ",stu[i].fin);
printf("%d/n",stu[i].fin);
}
return 0;
}
- TJU Exercise Contest 2011(7) A题
- TOJ 比赛C题 Visiting Cows (TJU 2011 Exercise Contest 04)
- HDU3996 Gold Mine最大权闭合图 2011 Multi-University Training Contest 16 - Host by TJU
- HDU3998 Sequence 动态规划+最大流2011 Multi-University Training Contest 16 - Host by TJU
- TJU训练赛—A
- 2009 Multi-University Training Contest 1 - Host by TJU
- codeforces contest 785 a题
- codeforces contest 779 A题
- TJU-4107. A simple problem(贪心)
- A Distributed Algorithm Exercise
- A. Contest
- http://codeforces.com/contest/7/problem/A
- Contest 2016-5-7 A(HDU 5615)
- A. A Good Contest
- 优秀程序员的竞赛 Welcome to attend TJU Contest September 2005
- Wireless Password [ 2009 Multi-University Training Contest 1 - Host by TJU ]
- Contest on codeforce A
- a sad contest
- ubuntu上安装jdk及配置,以及eclipse的安装,附加配置QT
- ip address & dns
- http://topic.csdn.net/u/20091130/15/900a408e-9ac6-4c94-83f8-f5a7414076ef.html
- String里不能不说的秘密
- 两种外排序的思路sorting by merging&sorting by distribution
- TJU Exercise Contest 2011(7) A题
- sql 内联与外联区别
- C#完整的通信代码(点对点,点对多,同步,异步,UDP,TCP)
- [Firefox][扩展系列][01]开发环境准备
- 40个技巧优化您的PHP代码
- VC中的 动态结构体
- 开源
- 使用Spring框架的好处(转帖)
- javaScript 一键复制