Problem A

贪心~:  尽量把绝对值大的变成正数, 如果操作数剩余,   那么如果剩余次数为奇数, 显然要舍去一个,  舍去绝对值最小的数;

#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <algorithm>
//#include "myAlgorithm.h"

#define MAX 100005
#define INF (1e8 + 5)
#define eps 1e-30
#define Rep(s, e) for( int i = s; i <= e; i++)
using namespace std;
int n, k;
int  a[MAX];
bool cmp(int a, int b){
    return abs(a) < abs(b);
}
int main()
 {
    //freopen("in.txt", "w", stdout);
    while(cin>>n>>k){
        Rep(1, n)cin>>a[i];
        sort(a + 1, a + n + 1, cmp);
        //Rep(1, n)cout<<a[i]<<" ";
        //cout<<endl;
        int ans = 0;
        for(int i = n; i >  0; i--){
            if(a[i] < 0 && k > 0){
                a[i] *= -1;
                k--;
            }ans += a[i];
        }
        if(k%2){
            ans -= 2 * a[1];
        }
        cout<<ans<<endl;
    }
    return 0;
}
/*
3 2 -1 -1 1
3 1 -1 -1 1
*/