AOJ V0 0001

top2hills.c

#include <stdio.h>

int cmp(const void *a, const void *b){
	return -(*(int*)a - *(int*)b);
}

int main(void) {
	int i, height;
	int l = 10;
	int hills[l];

	for (i = 0; i < l; i++) {
		scanf("%d", &height);
		hills[i] = height;
	}

	qsort(hills, l, sizeof(int), cmp);

	for (i = 0; i < 3; i++) {
		printf("%d\n", hills[i]);
	}

	return 0;
}