# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
145804 |
2019-08-21T07:01:51 Z |
kst7703 |
짝수 정렬 (tutorial3) |
C++14 |
|
2 ms |
376 KB |
#include <iostream>
#include <vector>
#include <algorithm>
#include "grader.h"
using namespace std;
void sort_even(int n, int *arr) {
vector<int> even;
for (int i = 0; i < n; i++)
if (arr[i] % 2 == 0)
even.push_back(arr[i]);
sort(even.begin(), even.end());
for (auto it : even)
Report(it);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
256 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 |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 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 |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
256 KB |
Output is correct |