| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 12842 | yongwhan | 짝수 정렬 (tutorial3) | C++98 | 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<algorithm>
#include<vector>
using namespace std;
int sort_even(int N, int A[]) {
vector<int> v(N);
for (int i=0; i<N; i++) v[i]=A[i];
sort(v.begin(), v.end());
for (int i=0; i<N; i++)
if(v[i]%2==0) Report(v[i]);
return 0;
}