| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 18922 | dltldls95 | 짝수 정렬 (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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void sort_even(int N, int* A)
{
  
  int num;
  cin >> num;
  int val = 0;
  vector<int> ar;
  for (int i = 0; i < num; i++)
  {
    cin >> val;
    if (val % 2 == 0)
      ar.push_back(val);
  }
  sort(ar.begin(), ar.end());
  for (std::vector<int>::iterator it = ar.begin() ; it != ar.end(); ++it)
    Report(*it);
  std::cout << endl;
}
