| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1611 | ho94949 | 짝수 정렬 (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;
void sort_even(int N, int* A){
vector<int> evens;
for(int i=0;i<N;i++){
if(A[i]%2==0) evens.push_back(A[i]);
}
sort(evens.begin(),evens.end());
for(int i=0;i<evens.size();i++){
Report(evens[i]);
}
return;
}