| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 145798 | uvelo | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <assert.h>
#include <malloc.h>
void sort_even(int N, int *A);
static int N, *A;
int result_n;
void Report (int val){
	assert(++result_n <= N);
	printf("%d ", val);
}
int main(){
	int i, tmp;
	tmp = scanf("%d", &N);
	assert(tmp == 1);
	A = (int*) malloc( sizeof(int) * N );
	for(i = 0; i < N; i++){
		tmp = scanf("%d", &A[i]);
		assert(tmp == 1);
	}
	sort_even(N, A);
	return 0;
}
