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.
题意:
(记一小事 , 这题本不花时间 , 谁知突闻窗外有吵骂声 , 于是八卦之魂燃起。打开窗户见远处一妇偕俩幼子与一男对骂。男不让女不退,甚至动手,扔手机。。。。。。不说了 , 再说就不是题解了)
给你一个数组n和一个变量K。将这个数组分成K段,取每一段中最小的数 , 最后输出这K个数中最大的
比如第一个样例 , 分成1 2 3 4 / 5,酱紫分。因为我如果想要输出的是最大的数,那我尽量单分出来的数较大才对。
思路:
当K = 1时 , 就直接找出数组中最小的那个就行了。
当K = 2时 , 比较开头和结尾的数字的大小就行了(原因:反正就只能分俩段 , 如果中间有更低的就把他分到另一半 , 然后还是比较俩端)
当K > 2时, 直接找数组里最大的那个就行啦 , 因为我至少可以把最大的那个数俩端掐,分离出来。
没啦 ! ! !
代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+8;
int a[maxn] , b[maxn];
int main()
{
int n , k , m;
scanf("%d %d" , &n ,&k);
for(int i = 0 ; i < n ; i++)
{
scanf("%d" , &a[i]);
b[i] = a[i];
}
sort(a , a+n);
if(k == 1)
{
printf("%d\n" , a[0]);
}
else if (k == 2)
{
m = max(b[0] , b[n-1]);
printf("%d\n" , m);
}
else
{
printf("%d\n" , a[n-1]);
}
return 0;
}