Submission #146238

#TimeUsernameProblemLanguageResultExecution timeMemory
146238Diuven짝수 정렬 (tutorial3)C++14
100 / 100
2 ms424 KiB
#include "grader.h" #include <bits/stdc++.h> using namespace std; void sort_even(int N, int *A) { vector<int> S; for(int i = 0; i < N; i++) { if(A[i] % 2 == 0) S.push_back(A[i]); } sort(S.begin(), S.end()); for(int x:S) Report(x); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...