B - Anti-knapsack
代码如下
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll t;
cin >> t;
while (t--)
{
ll n, k;
cin >> n >> k;
vector<ll> ans;
for (ll i = k + 1; i <= n; i++)
{
ans.push_back(i);
}
ll jie;
if (k % 2 == 0)
jie = k / 2;
else
jie = (k + 1) / 2;
for (ll i = jie; i < k; i++)
ans.push_back(i);
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); i++)
{
cout << ans[i];
if (i != ans.size() - 1)
cout << " ";
else
cout << endl;
}
}
}