一道acm题,
一道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
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
英语人气:781 ℃时间:2020-10-02 05:00:22
优质解答
个人感觉,可以先排序.那么最大的情况就是相邻两个组成一个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 ...#include#include#include using namespace std;int _tmain(int argc, _TCHAR* argv[]){int n,i,v[10000],max=0,min=0;scanf("%d",&n);for(i=0;i
我来回答
类似推荐