Submission #31361

#TimeUsernameProblemLanguageResultExecution timeMemory
31361topology짝수 정렬 (tutorial3)C++14
100 / 100
0 ms2016 KiB
#include <bits/stdc++.h>
using namespace std;

void sort_even(int n, int *a) {
  vector<int> b;
  for (int i = 0; i < n; i++) {
    if (a[i] % 2 == 0) b.push_back(a[i]);
  }
  sort(b.begin(), b.end());
  for (auto &val : b) {
    printf("%d\n", val);
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...