Second Max

#include <stdio.h>

int Sort(int * A) {
	int i,j,temp;
	for (i = 0; i < 3; i++) {
		for (j = i + 1; j < 4; j++)
		if (A[j] > A[i]) {
			temp = A[i];
			A[i] = A[j];
			A[j] = temp;
		}
	}
}

int SecondMax(int * A) {
	int i;
	Sort(A);
	for (i = 0; i < 4; i++) {
		if (A[i] != A[0]) {
			return A[i];
		}
	}
	return A[0];
}

int main() {
	int a,b,c,d;
	int A[4];
	scanf("%d%d%d%d",&a,&b,&c,&d);
	A[0] = a; A[1] = b; A[2] = c; A[3] = d;
	// Ban chat cua tim so thu 2 trong mang la sap xep mang thanh day giam. Dung 1 vong for kiem tra phan tu vi tri hien tai co khac voi
	// A[0] (tuc la max) hay khong. Neu co thi A[i] la so lon thu 2.
	printf("%d",SecondMax(A));
}