# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
868033 |
2023-10-30T09:23:42 Z |
MongHwa |
짝수 정렬 (tutorial3) |
C++17 |
|
0 ms |
348 KB |
#include "grader.h"
#include <vector>
#include <algorithm>
using namespace std;
void sort_even(int N, int *A)
{
vector<int> 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 < (int)v.size(); i++)
Report(v[i]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |