# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
145824 |
2019-08-21T07:05:30 Z |
xxxxorb0221 |
짝수 정렬 (tutorial3) |
C++14 |
|
2 ms |
384 KB |
#include<algorithm>
#include<vector>
#include"grader.h"
using namespace std;
void sort_even(int N, int* A){
vector<int> E;
for (int i = 0; i<N; i++)
{
if (A[i] % 2 == 0)
E.push_back(A[i]);
}
sort(E.begin(), E.end());
int size = E.size();
for (int i = 0; i < size; i++)
Report(E[i]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
252 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
380 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
384 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |