# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
13900 |
2015-04-17T09:10:59 Z |
minsu |
짝수 정렬 (tutorial3) |
C++14 |
|
0 ms |
1720 KB |
#include "grader.h"
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
void sort_even(int N, int *A){
vector<int> newA;
for(int i=0;i<N;i++)
if(A[i]%2==0) newA.push_back(A[i]);
sort(newA.begin(), newA.end());
for(int i : newA) Report(i);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1720 KB |
Output is correct |
2 |
Correct |
0 ms |
1720 KB |
Output is correct |
3 |
Correct |
0 ms |
1720 KB |
Output is correct |
4 |
Correct |
0 ms |
1720 KB |
Output is correct |
5 |
Correct |
0 ms |
1720 KB |
Output is correct |
6 |
Correct |
0 ms |
1720 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1720 KB |
Output is correct |
2 |
Correct |
0 ms |
1720 KB |
Output is correct |
3 |
Correct |
0 ms |
1720 KB |
Output is correct |
4 |
Correct |
0 ms |
1720 KB |
Output is correct |
5 |
Correct |
0 ms |
1720 KB |
Output is correct |
6 |
Correct |
0 ms |
1720 KB |
Output is correct |
7 |
Correct |
0 ms |
1720 KB |
Output is correct |
8 |
Correct |
0 ms |
1720 KB |
Output is correct |