| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 145847 | leewj1025 | 짝수 정렬 (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 "grader.h"
void sort_even(int N, int *a) {
	int i;
	for(int i=0;i<N;i++){
      for(int j=0;j<i;j++){
	if(A[i]<a[j]){
      int temp=a[i];
      a[i]=a[j];
      a[j]=temp;
    }		
      }
    }
	for(i = 0; i < N; i++) {
		if(a[i] % 2 == 0) Report(a[i]);
	}
}
