# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
2626 | kipa00 | 짝수 정렬 (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>
#include "grader.h"
using namespace std;
void sort_even(int N, int *A) {
vector<int> res;
int i;
for (i=0; i<N; ++i) {
if (!(*(A + i) % 2)) res.push_back(*(A+i));
}
sort(res.begin(), res.end());
for (i=0; i<res.size(); ++i) [
Report(res[i]);
}
}