| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 145832 | 2019-08-21T07:06:27 Z | j07801 | 짝수 정렬 (tutorial3) | C++14 | 0 ms | 0 KB |
#include<stdio.h>
#include<algorithm>
#include "grader.h"
using namespace std;
int B[1000000];
int sort_even(int N,*A){
int cnt = 0;
for (int i = 0; i < N; i++){
if (A[i] % 2 == 0){
B[cnt++] = A[i];
}
}
sort(B, B + cnt);
for (int i = 0; i < cnt; i++){
Report(B[i]);
}
return 0;
}