JZOJ4882. 【NOIP2016提高A组集训第12场11.10】多段线性函数

Description

Data Constraint

Solution

考虑到一段区间内取的只要尽量靠近，所以我们可以将输入的l,r拆开后排序，取中间一段即可。

Code

#include
#include
#include
#include
#include
#define ll long long
using namespace std;
const int maxn=200005;
ll a[maxn],n,i,t,j,k,l,r,mid,x,y;
int main(){
    freopen("linear.in","r",stdin);freopen("linear.out","w",stdout);
    scanf("%lld",&n);
    for (i=1;i<=n;i++)
        scanf("%lld%lld",&a[i],&a[i+n]);
    n*=2;
    sort(a+1,a+n+1);
    t=n/2;
    printf("%lld %lld\n",a[t],a[t+1]);
}