Submission #145835

#TimeUsernameProblemLanguageResultExecution timeMemory
145835wesley2003짝수 정렬 (tutorial3)C++14
100 / 100
3 ms376 KiB
#include <iostream> #include <vector> #include <algorithm> #include "grader.h" using namespace std; void sort_even(int n, int *arr) { int a[1200],cnt=0; for (int i = 0; i < n; i++) if (arr[i] % 2 == 0){ a[cnt]=arr[i]; cnt++; } sort(a, a+cnt); for (int i=0;i<cnt;i++) Report(a[i]); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...