← 返回题目
题库练习 Sereja and Swaps
← 上一题 下一题 →

A9378 | Sereja and Swaps

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

As usual, Sereja has array $a$ , its elements are integers: $a[1],a[2],...,a[n]$ . Let's introduce notation:

![](/uploads/acgo/image/6e19fda8f112bf0b_12ec7c3a87f3.jpeg)A swap operation is the following sequence of actions:

- choose two indexes $i,j$ $(i≠j)$ ;
- perform assignments $tmp=a[i],a[i]=a[j],a[j]=tmp$ .

What maximum value of function $m(a)$ can Sereja get if he is allowed to perform at most $k$ swap operations?

输入格式

The first line contains two integers $n$ and $k$ $(1<=n<=200; 1<=k<=10)$ . The next line contains $n$ integers $a[1]$ , $a[2]$ , $...$ , $a[n]$ $(-1000<=a[i]<=1000)$ .

输出格式

In a single line print the maximum value of $m(a)$ that Sereja can get if he is allowed to perform at most $k$ swap operations.

输入输出样例

输入 #1
10 2
10 -1 2 2 2 2 2 2 -1 10
输出 #1
32
输入 #2
5 10
-1 -1 -1 -1 -1
输出 #2
-1
C++ 编辑器
输入
输出