题目描述:
Given n elements, which have two properties, say Property A and Property B. For convenience, we use two integers A i and B i to measure the two properties.
Your task is, to partition the element into two sets, say Set A and Set B , which minimizes the value of max (x∈Set A) {A x}+max (y∈Set B) {B y}.
See sample test cases for further details.
输入描述:
There are multiple test cases, the first line of input contains an integer denoting the number of test cases.
For each test case, the first line contains an integer N, indicates the number of elements. (1 <= N <= 100000)
For the next N lines, every line contains two integers A i and B i indicate the Property A and Property B of the ith element. (0 <= A i, B i <= 1000000000)
输出描述:
For each test cases, output the minimum value.
输入:
1
3
1 100
2 100
3 1
输出:
Case 1: 3
题意:
一个元素分为2个属性,a和b。然后将元素分成2个集合A和B。求出A集合的a属性的最大值+B集合的b属性的最大值,的最小值
题解:
贪心问题
然后枚举max(x),确定A、B集合,并时刻更新B的最大。
对于A而言,当max(x)确定的时候,大于x的放B放,这样才不会使max(x)变大。
代码:
#include<cstdio>
#include<cstring>