#include <bits/stdc++.h>
using namespace std;
const int N=1e4+10;
const int INF=0x3f3f3f3f;
int a[N],s[N],ans,n;
bool f;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	cin>>x;
	for(int i=n-x+1;i<=n;i++)
	{
		cout<<a[i]<<" ";
	}
	for(int i=1;i<=n-x;i++)
	{
		cout<<a[i]<<" ";
	}
	return 0;
}

朴实无华

#include <iostream>
#include <stack>
#include <cmath>
#include <vector>
#include <string.h>
#include <queue>
#include <stdio.h>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
int a[N];
signed main()
{
	int n, x;
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	cin >> x;
	for(int i = n - x + 1; i <= n; i++)
	{
		cout << a[i] << " ";
	}
	for(int i = 1; i <= n - x; i++)
	{
		cout << a[i] << " ";
	}
	return 0;
}

可以有“ ”空格啊