# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
145809 |
2019-08-21T07:03:32 Z |
wesley2003 |
짝수 정렬 (tutorial3) |
C++14 |
|
2 ms |
376 KB |
#include <stdio.h>
#include <assert.h>
#include <malloc.h>
#include <algorithm>
using namespace std;
int sort_even(int N,int *A){
int arr[20]={0,},cnt=0;
for(int i=0;i<N;i++){
if(A[i]%2==0){
arr[cnt]=A[i];
cnt++;
}
}
sort(arr,arr+cnt);
return *arr;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 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 |
- |