codeforces262B

B. Roma and Changing Signs

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Roma works in a company that sells TVs. Now he has to prepare a report for the last year.

Roma has got a list of the company's incomes. The list is a sequence that consists of n integers. The total income of the company is the sum of all integers in sequence. Roma decided to perform exactly k changes of signs of several numbers in the sequence. He can also change the sign of a number one, two or more times.

The operation of changing a number's sign is the operation of multiplying this number by -1.

Help Roma perform the changes so as to make the total income of the company (the sum of numbers in the resulting sequence) maximum. Note that Roma should perform exactly k changes.

Input

The first line contains two integers n and k (1 ≤ n, k ≤ 105), showing, how many numbers are in the sequence and how many swaps are to be made.

The second line contains a non-decreasing sequence, consisting of n integers ai (|ai| ≤ 104).

The numbers in the lines are separated by single spaces. Please note that the given sequence is sorted in non-decreasing order.

Output

In the single line print the answer to the problem — the maximum total income that we can obtain after exactly k changes.

Examples

input

Copy

3 2
-1 -1 1

output

Copy

3

input

Copy

3 1
-1 -1 1

output

Copy

1

Note

In the first sample we can get sequence [1, 1, 1], thus the total income equals 3.

In the second test, the optimal strategy is to get sequence [-1, 1, 1], thus the total income equals 1.

一道贪心题这道题并没有限制n，k的大小关系也就是说它可以修改比n还多的次数而且必须修改k次不能多也不能少这是题意比较难想的地方。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=13;
typedef long long  ll;
ll a[200100];

int m,n,pos;
ll maxx=0x3f3f3f3f;
int main()
{
    int ans=0;
    cin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        cin>>a[i];
        if(a[i]<0&&ans<m)
        {
            a[i]*=-1;
            ans++;
        }
    }
    if(ans<m)
        {
            sort(a+1,a+1+n);
            if((m-ans)%2)
                a[1]=-a[1];
        }
    ll an=0;
    for(int i=1;i<=n;i++)
        an+=a[i];
    cout<<an<<endl;
}