慧通编程第九关

991 有序插入

#include <bits/stdc++.h>
using namespace std;

const int N = 109;
int n, a[N];

int main() {
   
   
	cin >> n;
	for (int i = 1; i <= n; i ++) cin >> a[i];
	cin >> a[++n];
	
	int k = n;
	while (a[k] > a[k-1] && k >= 2) {
   
   
		swap(a[k], a[k-1]);
		k --;
	}
	
	for (int i = 1; i <= n; i ++) cout << a[i] << ' ';

	return 0;
}

992 插队

#include <bits/stdc++.h>
using namespace std;

const int N = 109;
int n, x, a[N];

int main() {
   
   
	cin >> n;
	for (int i = 1; i <= n; i ++) {
   
   
		cin >> a[i];
		
		if (a[i] + a[i-1] > 350) {
   
   
			cout << 50 << ' ';
		}
		cout << a[i] << ' ';
	}

	return 0;
}

993 删除数组中重复的数

#include <bits/stdc++.h>
using namespace std;

int n, x;
set <int> s;
set <int> :: iterator it;

int main() {