zoukankan      html  css  js  c++  java
  • Codeforces 934 A.Compatible Pair

    http://codeforces.com/contest/934

    A. A Compatible Pair
     
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill their villages with red colour, light, and cracking noise, all of which frighten the monster out of coming.

    Little Tommy has n lanterns and Big Banban has m lanterns. Tommy's lanterns have brightness a1, a2, ..., an, and Banban's have brightness b1, b2, ..., bm respectively.

    Tommy intends to hide one of his lanterns, then Banban picks one of Tommy's non-hidden lanterns and one of his own lanterns to form a pair. The pair's brightness will be the product of the brightness of two lanterns.

    Tommy wants to make the product as small as possible, while Banban tries to make it as large as possible.

    You are asked to find the brightness of the chosen pair if both of them choose optimally.

    Input

    The first line contains two space-separated integers n and m (2 ≤ n, m ≤ 50).

    The second line contains n space-separated integers a1, a2, ..., an.

    The third line contains m space-separated integers b1, b2, ..., bm.

    All the integers range from  - 109 to 109.

    Output

    Print a single integer — the brightness of the chosen pair.

    Examples
    input
    Copy
    2 2
    20 18
    2 14
    output
    252
    input
    Copy
    5 3
    -1 0 1 2 3
    -1 0 1
    output
    2
    Note

    In the first example, Tommy will hide 20 and Banban will choose 18 from Tommy and 14 from himself.

    In the second example, Tommy will hide 3 and Banban will choose 2 from Tommy and 1 from himself.

    代码:

     1 //A
     2 #include<iostream>
     3 #include<cstring>
     4 #include<cstdio>
     5 #include<cmath>
     6 #include<algorithm>
     7 #include<queue>
     8 using namespace std;
     9 typedef long long ll;
    10 const int maxn=10000+10;
    11 ll a[maxn],b[maxn];
    12 int main(){
    13     ll n,m,mx;
    14     int ok;
    15     while(~scanf("%lld%lld",&n,&m)){
    16         for(int i=1;i<=n;i++)
    17             scanf("%lld",&a[i]);
    18         for(int i=1;i<=m;i++)
    19             scanf("%lld",&b[i]);
    20         mx=0-1LL<<62;
    21         for(int i=1;i<=n;i++){
    22             for(int j=1;j<=m;j++){
    23                 if(a[i]*b[j]>=mx)
    24                     mx=a[i]*b[j],ok=i;
    25             }
    26         }
    27         mx=-1LL<<62;
    28         for(int i=1;i<=n;i++){
    29             for(int j=1;j<=m;j++){
    30                 if(a[i]*b[j]>=mx&&ok!=i)mx=a[i]*b[j];
    31             }
    32         }
    33         printf("%lld
    ",mx);
    34     }
    35     return 0;
    36 }
     
  • 相关阅读:
    TestNG测试用例编写和执行
    Myeclipse+TestNG白盒测试环境搭建
    Jmeter创建一个简单的http接口用例
    python 格式化日期
    测试需求分析总结
    mac终端配色
    浅谈游戏中BUFF的设计要点
    图片头代码
    My.Ioc 代码示例——避免循环依赖
    My.Ioc 代码示例——谈一谈如何实现装饰器模式,兼谈如何扩展 My.Ioc
  • 原文地址:https://www.cnblogs.com/ZERO-/p/8584057.html
Copyright © 2011-2022 走看看