一道acm题,Problem H:Groups (I)Time Limit:1000MS Memory Limit:65536KTotal Submit:93 Accepted:31 Description There are n people in the class and person pi has his value vi.Now,we'd like to put them into different groups.In each group,there must
来源：学生作业帮助网 编辑：六六作业网 时间：2024/11/16 12:38:47
一道acm题,Problem H:Groups (I)Time Limit:1000MS Memory Limit:65536KTotal Submit:93 Accepted:31 Description There are n people in the class and person pi has his value vi.Now,we'd like to put them into different groups.In each group,there must
一道acm题,
Problem H:Groups (I)
Time Limit:1000MS Memory Limit:65536K
Total Submit:93 Accepted:31
Description
There are n people in the class and
person pi has his value vi.Now,we'd like to put them into different groups.In
each group,there must be two people,and the value of this group is equal to
the minimum of two member's values.For example,if pi and pj are in the same
group,the value of their group is min(pi,pj).Now,your task is to tell the
maximum and minimum of the sum of all groups.
Input
There are several test cases.
In
each case,there is an even integer n(n
一道acm题,Problem H:Groups (I)Time Limit:1000MS Memory Limit:65536KTotal Submit:93 Accepted:31 Description There are n people in the class and person pi has his value vi.Now,we'd like to put them into different groups.In each group,there must
个人感觉,可以先排序.那么最大的情况就是相邻两个组成一个pair,最小的情况就是首尾组成一个pair.例如,input：1 2 3 4 5 6 7 8 9 10.最大的情况就是（1 2）（3 4）（5 6）（7 8）（9 10）,最小的情况就是（1 10）（2 9）（3 8）（4 7）（5 6）.当然,最小的情况还有很多种排法,只要保证是最小的5个数输出就行,例如（1 6）（2 7）（3 8）（4 9）（5 10）也是可以的