zoukankan      html  css  js  c++  java
  • codeforces710B

    Optimal Point on a Line

     CodeForces - 710B 

    You are given n points on a line with their coordinates xi. Find the point x so the sum of distances to the given points is minimal.

    Input

    The first line contains integer n (1 ≤ n ≤ 3·105) — the number of points on the line.

    The second line contains n integers xi ( - 109 ≤ xi ≤ 109) — the coordinates of the given n points.

    Output

    Print the only integer x — the position of the optimal point on the line. If there are several optimal points print the position of the leftmost one. It is guaranteed that the answer is always the integer.

    Example

    Input
    4
    1 2 3 4
    Output
    2

    sol:就是找个中位数,分奇偶讨论即可
    #include <bits/stdc++.h>
    using namespace std;
    typedef int ll;
    inline ll read()
    {
        ll s=0;
        bool f=0;
        char ch=' ';
        while(!isdigit(ch))
        {
            f|=(ch=='-'); ch=getchar();
        }
        while(isdigit(ch))
        {
            s=(s<<3)+(s<<1)+(ch^48); ch=getchar();
        }
        return (f)?(-s):(s);
    }
    #define R(x) x=read()
    inline void write(ll x)
    {
        if(x<0)
        {
            putchar('-'); x=-x;
        }
        if(x<10)
        {
            putchar(x+'0'); return;
        }
        write(x/10);
        putchar((x%10)+'0');
        return;
    }
    #define W(x) write(x),putchar(' ')
    #define Wl(x) write(x),putchar('
    ')
    const int N=300005;
    int n,A[N];
    int main()
    {
        int i;
        R(n);
        for(i=1;i<=n;i++) R(A[i]);
        sort(A+1,A+n+1);
        if(n&1) Wl(A[(n+1)>>1]);
        else Wl(A[n>>1]);
        return 0;
    }
    /*
    input
    4
    1 2 3 4
    output
    2
    */
    View Code
     
  • 相关阅读:
    mongo的csv文件参考
    apache安装配置
    部署Java的运行环境
    ubuntu下没有ping命令
    webbench压力测试
    判断当前是否是微信浏览器,还是APP客户端
    PHP uniqid 高并发生成不重复唯一ID
    http_build_query()函数使用方法
    防XSS攻击
    PHP中json_encode()使用须知,JSON数组和JSON对象
  • 原文地址:https://www.cnblogs.com/gaojunonly1/p/10585252.html
Copyright © 2011-2022 走看看