# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
511142 | 2022-01-15T08:56:04 Z | Salama | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include <grader.h> using namespace std; int z[100000]; void q2(int x,int *q){ int d=0; for(int o=0;o<x;o++){ if(q[o]%2==0){z[d]=q[o]; d++;}} sort(z,z+d); for(int o=0;o<d;o++)Report (z[o]); }