Maximum of Maximums of Minimums codeforces 872 B（简单思路）

题意：给你一个数组，长度为n，要你把数组分为k组，注意每一组都必须要是连续的，从每段里面取最小值，然后从k个最小值里面找出最大值就是答案。

#include<stdio.h>
#include<algorithm>
using namespace std;
const int N=1e5+5;
int a[N],maxa,mina;
int main()
{
    int n,k,a0,an;
    while(~scanf("%d%d",&n,&k))
    {
        mina=2000000000,maxa=-2000000000;
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            maxa=max(maxa,a[i]);
            mina=min(mina,a[i]);
        }
        a0=a[0],an=a[n-1];
        sort(a,a+n);
        if(k==1) printf("%d\n",mina);
        else if(k==2)
        {
            if(a0==maxa||an==maxa) printf("%d\n",maxa);
            else
            {
                if(a0==mina) printf("%d\n",an);
                else if(an==mina) printf("%d\n",a0);
                else printf("%d\n",max(a0,an));
            }
        }
        else printf("%d\n",maxa);
    }
}

其实这样子就可以了

#include<stdio.h>
#include<algorithm>
using namespace std;
const int N=1e5+5;
int a[N],maxa,mina;
int main()
{
    int n,k,a0,an;
    while(~scanf("%d%d",&n,&k))
    {
        mina=2000000000,maxa=-2000000000;
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            maxa=max(maxa,a[i]);
            mina=min(mina,a[i]);
        }
        a0=a[0],an=a[n-1];
        sort(a,a+n);
        if(k==1) printf("%d\n",mina);
        else if(k==2) printf("%d\n",max(a0,an));
        else printf("%d\n",maxa);
    }
}

You are given an array a1, a2, ..., an consisting of n integers, and an integer k. You have to split the array into exactly k non-empty subsegments. You'll then compute the minimum integer on each subsegment, and take the maximum integer over the k obtained minimums. What is the maximum possible integer you can get?

Definitions of subsegment and array splitting are given in notes.

Input

The first line contains two integers n and k (1 ≤ k ≤ n ≤  105) — the size of the array a and the number of subsegments you have to split the array to.

The second line contains n integers a1,  a2,  ...,  an ( - 109  ≤  ai ≤  109).

Output

Print single integer — the maximum possible integer you can get if you split the array into k non-empty subsegments and take maximum of minimums on the subsegments.

Examples

Input

5 2
1 2 3 4 5

Output

5

Input

5 1
-4 -5 -3 -2 -1

Output

-5

Note

A subsegment [l,  r] (l ≤ r) of array a is the sequence al,  al + 1,  ...,  ar.

Splitting of array a of n elements into k subsegments [l1, r1], [l2, r2], ..., [lk, rk] (l1 = 1, rk = n, li = ri - 1 + 1 for all i > 1) is k sequences (al1, ..., ar1), ..., (alk, ..., ark).

In the first example you should split the array into subsegments [1, 4] and [5, 5] that results in sequences (1, 2, 3, 4) and (5). The minimums are min(1, 2, 3, 4) = 1 and min(5) = 5. The resulting maximum is max(1, 5) = 5. It is obvious that you can't reach greater result.

In the second example the only option you have is to split the array into one subsegment [1, 5], that results in one sequence ( - 4,  - 5,  - 3,  - 2,  - 1). The only minimum is min( - 4,  - 5,  - 3,  - 2,  - 1) =  - 5. The resulting maximum is  - 5.