# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
151814 |
2019-09-05T03:30:01 Z |
erebos |
짝수 정렬 (tutorial3) |
C++17 |
|
2 ms |
504 KB |
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
void sort_even(int N, int *A) {
vector<int>temp;
int i;
for(i = 0; i < N; i++) {
if(A[i] % 2 == 0) temp.push_back(A[i]);
}
sort(temp.begin(), temp.end());
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
504 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |