Codeforces Round #209 (Div. 2) B. Alyona and flowers

B. Permutation
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
A permutation p is an ordered group of numbers p1,   p2,   …,   pn, consisting of n distinct positive integers, each is no more than n. We’ll define number n as the length of permutation p1,   p2,   …,   pn.

Simon has a positive integer n and a non-negative integer k, such that 2k ≤ n. Help him find permutation a of length 2n, such that it meets this equation: .

Input
The first line contains two integers n and k (1 ≤ n ≤ 50000, 0 ≤ 2k ≤ n).

Output
Print 2n integers a1, a2, …, a2n — the required permutation a. It is guaranteed that the solution exists. If there are multiple solutions, you can print any of them.

Examples
input
1 0
output
1 2
input
2 1
output
3 2 1 4
input
4 0
output
2 7 4 6 1 3 5 8
Note
Record |x| represents the absolute value of number x.

In the first sample |1 - 2| - |1 - 2| = 0.

In the second sample |3 - 2| + |1 - 4| - |3 - 2 + 1 - 4| = 1 + 3 - 2 = 2.

In the third sample |2 - 7| + |4 - 6| + |1 - 3| + |5 - 8| - |2 - 7 + 4 - 6 + 1 - 3 + 5 - 8| = 12 - 12 = 0

题目大意：
给你一个n和一个k，问1-2n如何排列能满足

思路：
若等式中每项a2i-1>a2i，即绝对值均为正数，该是等于0，这是k为0的情况
若k不为0，因为0 ≤ 2k ≤ n，所以只需处理第一组，将a2i-1置为2n-k，a2i置为2n，则该式成立

代码：

/*************************************************************************
    > File Name: 359B.cpp
    > Author: SIU
    > Created Time: 2016年11月28日 星期一 14时57分51秒
 ************************************************************************/

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
    int n,k;
    scanf("%d%d",&n,&k);
    int num[100050];
    int visit[100050];
    memset(visit,0,sizeof(visit));
    for(int i=1;i<=2*n;i++)
        num[i]=i;
    if(k!=0)
    {
        printf("%d %d",num[2*n-k],num[2*n]);
        visit[2*n-k]=1;
        visit[2*n]=1;
    }
    else
    {
        printf("%d %d",num[2*n],num[1]);
        visit[2*n]=1;
        visit[1]=1;
    }
    for(int i=2*n;i>0;i--)
    {
        if(visit[i]==0)
        {
            printf(" %d",num[i]);
            visit[i]=1;
            for(int j=1;j<=2*n;j++)
            {
                if(visit[j]==0)
                {
                    printf(" %d",num[j]);
                    visit[j]=1;
                    break;
                }
            }
        }
    }
    printf("\n");
    return 0;
}