# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
525234 | 2022-02-11T07:19:20 Z | pokmui9909 | 짝수 정렬 (tutorial3) | C++17 | 1 ms | 292 KB |
#include "grader.h" #include <bits/stdc++.h> using namespace std; using ll = long long; void sort_even(int N, int *A){ vector<ll> V; for(int i = 0; i < N; i++){ if(A[i] % 2 == 0){ V.push_back(A[i]); } } sort(V.begin(), V.end()); for(int i = 0; i < V.size(); i++){ Report(V[i]); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 288 KB | Output is correct |
5 | Correct | 0 ms | 292 KB | Output is correct |
6 | Correct | 0 ms | 204 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 288 KB | Output is correct |
2 | Correct | 0 ms | 288 KB | Output is correct |
3 | Correct | 1 ms | 292 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 272 KB | Output is correct |
6 | Correct | 0 ms | 204 KB | Output is correct |
7 | Correct | 1 ms | 204 KB | Output is correct |
8 | Correct | 1 ms | 204 KB | Output is correct |