zoukankan      html  css  js  c++  java
  • I can do it!(贪心)

    I can do it!

    Time Limit: 2000/2000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1010    Accepted Submission(s): 471

    Problem Description
    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.
     
    Input
    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)
     
    Output
    For each test cases, output the minimum value.
     
    Sample Input
    1 3 1 100 2 100 3 1
     
    Sample Output
    Case 1: 3
     
    Author
    HyperHexagon
     

    题解:题意好难理解啊,意思是给你一些元素,然后把这些元素分到两个集合里面;

    然后找A集合中a最大值加上B集合中b最大值的和的最小化;可以用贪心来找。。。

    代码:

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cmath>
    #include<algorithm>
    using namespace std;
    #define mem(x,y) memset(x,y,sizeof(x))
    #define T_T while(T--)
    #define SI(x) scanf("%d",&x)
    #define SL(x) scanf("%lld",&x)
    typedef long long LL;
    const int INF=0x3f3f3f3f;
    const int MAXN=100010;
    struct Node{
    	int a,b;
    	friend bool operator < (Node x,Node y){
    		return x.a>y.a;
    	}
    };
    Node dt[MAXN];
    int main(){
    	int T,N,kase=0;
    	SI(T);
    	T_T{
    		SI(N);
    		for(int i=0;i<N;i++)SI(dt[i].a),SI(dt[i].b);
    		sort(dt,dt+N);
    		int A,B=0,ans=INF;
    		for(int i=0;i<N;i++){
    			ans=min(ans,B+dt[i].a);
    			B=max(dt[i].b,B);
    		}
    		printf("Case %d: %d
    ",++kase,ans);
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    GateWay的简单使用
    SpringCloud项目注册到Nacos
    Hystrix整合Gateway
    Nginx配置socket.io集群
    windows搭建git服务
    解决gitLab上新建分支,idea中找不到对应分支问题
    mybatis mapper.xml的特殊操作符
    Chrome添加Axure RP插件
    idea Tomcat部署时没有update classes and resources
    缓存穿透,缓存击穿,缓存雪崩解决方案分析【转载】
  • 原文地址:https://www.cnblogs.com/handsomecui/p/5060965.html
Copyright © 2011-2022 走看看