#include <stdio.h>

int nA;
int nB;
int A[100] = {1,2,20,4,5};
int B[100] = {9,5,10,4,11};

void Insert(int * A, int k, int * n, int value) {
	for (int i = *n; i >= k + 1; i--) {
		A[i] = A[i-1];
	}
	A[k] = value;
	(*n)++;
}

void Delete(int * A, int k, int * n) {
	for (int i = k; i < *n; i++) {
		A[i] = A[i+1];
	}
	(*n)--;
}

void Noi() {
	int i;
	int max = -99999;
	int d,key;
	int first = 0;
	while (nA > 0) {
		d = 1;
		for (i = first; i < nB; i++) {
			if (B[i] > max) {
				max = B[i];
				key = i;
			}
		}
		for (i = 0; i < nA; i++) {
			if (A[i] > max) {
				max = A[i];
				key = i;
				d = 0;
			}
		}
		if (d == 0) {
			Delete(A,key,&nA);
			Insert(B,first,&nB,max);
			max = -999999;
		} else {
			Delete(B,key,&nB);
			Insert(B,first,&nB,max);
			max = -999999;
		}
		first++;
	}
}

int main() {
	nA = 5;
	nB = 5;
	printf("Mang A: \n");
	for (int i = 0; i < nA; i++) {
		printf("%d ",A[i]);
	}
	printf("\n");
	printf("Mang B: \n");
	for (int i = 0; i < nB; i++) {
		printf("%d ",B[i]);
	}
	printf("\n");
	Noi();
	printf("Mang B (sau khi tron): \n");
	for (int i = 0; i < nB; i++) {
		printf("%d ",B[i]);
	}
}