[codeforces]Levko and Permutation
辣鸡构造题
#include<bits/stdc++.h>
using namespace std;
int n,k;
int g[100010],cnt;
int main()
{
cin>>n>>k;
if(n==k){
puts("-1");return 0;}
for(int i=n-k+1;i<=n;i++)g[i]=i;
g[1]=n-k;
for(
辣鸡构造题
#include<bits/stdc++.h>
using namespace std;
int n,k;
int g[100010],cnt;
int main()
{
cin>>n>>k;
if(n==k){
puts("-1");return 0;}
for(int i=n-k+1;i<=n;i++)g[i]=i;
g[1]=n-k;
for(