| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 145817 | hahorse | 짝수 정렬 (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 <vector>
#include <algorithm>
using namespace std;
int sort_even(int n, int *a){
	vector <int > v;
	for(int i=0;i<n;i++){
      if(a[i]%2==0){
        v.push_back(a[i]);
      }
    }
  sort(v.begin(),v.end();
	for(auto it:v){
      Report(it);
    }
}
