#include<bits/stdc++.h>
using namespace std;
struct p{
	int k,j;
}; 
p a[10005],b[10005];
bool abc(p a,p b){
	return a.k < b.k; 
}
int main(){
	int n;
	cin >> n;
	for(int i = 1;i <= n;i++){
		cin >> a[i].k;
		a[i].j = i;	
		b[i].k = a[i].k;
		b[i].j = i;
	}
	
	int ans = 0;
	sort(a+1,a + n + 1,abc);
	/*
	for(int i = 1;i <= n;i++){
		cout << a[i].k << " " << a[i].j << " ";
    }
    cout << "\n";
    for(int i = 1;i <= n;i++){
		cout << b[i].k << " " << b[i].j << " ";
    }
    */
	for(int i = 1;i <= n;i++){
		cout << a[i].k << " " << b[i].k << "\n";
		if(a[i].k != b[i].k){
			for(int u = i+1;u <= n;u++){
				if(a[i].k == b[u].k){
					ans += abs(i - u);
					break;					
				}
			}
		}
	}
	//cout << ans;
	return 0;
} 

排队问题

#include<bits/stdc++.h>
using namespace std;
long long z(int a){
	a *= 7;
	while(a > 9){
		int y = a,b = 0;
		while(y > 0){
			b = b * 10 + y % 10;
		}
		a = b;
	}
	return a;
}
vector<int> g;
int main(){
	int n;
	cin >> n;
	for(int i = 1;i <= n;i++){
		long long x,h = 1;
		cin >> x;
		while(x != 0){
			g.push_back(x % 10);
			x /= 10; 
		}
		reverse(g.begin(), g.end());
		int len = g.size();
		for(int j = 1;j <= len;j += 2){
			g[j] = z(g[j]);
		} 
		
	}
	return 0;
}

幸运数

#include<bits/stdc++.h>
using namespace std;
int a[25],b[25];
int main(){
	int x,y,z;
	cin >> x >> y >> z;	
	for(int i = 1;i <= x;i++){
		cin >> a[i];
	}
	int maxn = 0;
	for(int i = 1;i <= y;i++){
		int n,cnt = 0;
		cin >> n;
		if(b[n] == 0){
			b[n] = 1;
			cnt += a[n];
			//cout << cnt << " ";
			if(maxn < cnt){
				maxn = cnt;
				cout << maxn << " ";
			}  
			if(cnt > z){
				cout << "Oh, My God!";
				return 0;
			}
		}
		else{
			b[n] = 0;
			cnt -= a[n];
		}
	}	
	cout << maxn;
	return 0;
}

西湖

#include<bits/stdc++.h>
using namespace std;
vector<int> a; 
int main(){
	int n;
	cin >> n;
	int b = n;
	a.push_back(0);
	while(n--){
		int x;
		cin >> x;
		a.push_back(x);
	}
	int cnt = 0;
	for(int i = 1;i <= b;i++){
		int x = a[i],d = 0;
		for(int j = i+1;j <= b;j++){
			if(x > a[j]){
				x = a[j];
				d = j;
			}
		}
		int y = d,l = i;
		if(y < l)  swap(y,l);
		cnt += y - l;
		swap(a[i],a[x]);
	}		
	cout << cnt;
	return 0;
}

新的

#include<bits/stdc++.h>
using namespace std;
vector<int> a; 
int main(){
	int n;
	cin >> n;
	int b = n;
	while(n--){
		int x;
		cin >> x;
		a.push_back(x);
	}
	int cnt = 0;
	for(int i = 0;i < b;i++)
		for(int j = i+1;j < b;j++){
			if(a[i]> a[j]){
				cnt += j - i;
				swap(a[i],a[j]);
			}
		} 
	cout << cnt;
	return 0;
}

旧的