http://cdn.ac.nbutoj.com/Problem/view.xhtml?id=1198&& I can do it
日期：2014-05-17 浏览次数：20578 次
http://cdn.ac.nbutoj.com/Problem/view.xhtml?id=1198&& I can do it!
问题描述
输入
输出
样例输入
样例输出
Given n elements, which have two properties, say Property A and Property B. For convenience, we use two integers Ai
and Bi
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) {Ax}+max(y∈Set B) {By}.
See sample test cases for further details.
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) {Ax}+max(y∈Set B) {By}.
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 Ai and Bi indicate the Property A and Property B of the ith element. (0 <= Ai, Bi <= 1000000000)
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 Ai and Bi indicate the Property A and Property B of the ith element. (0 <= Ai, Bi <= 1000000000)
For each test cases, output the minimum value.
1 3 1 100 2 100 3 1
Case 1: 3
题意：找出一个最大的和最小，
思路：先排序，然后枚举即可，，
AC代码：
#include<iostream>
#include<string.h>
#include<cstdio>
#include<memory.h>
#include<algorithm>
#include<vector>
#define N 100005
using namespace std;
typedef struct node
{
__int64 x;
__int64
免责声明： 本文仅代表作者个人观点，与爱易网无关。其原创性以及文中陈述文字和内容未经本站证实，对本文以及其中全部或者部分内容、文字的真实性、完整性、及时性本站不作任何保证或承诺，请读者仅作参考，并请自行核实相关内容。
