# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
18925 |
2016-02-16T12:50:11 Z |
dltldls95 |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
1720 KB |
#include <iostream>
#include <vector>
#include <algorithm>
#include "grader.h"
using namespace std;
void sort_even(int N, int* A)
{
int num;
cin >> num;
int val = 0;
vector<int> ar;
for (int i = 0; i < num; i++)
{
cin >> val;
if (val % 2 == 0)
ar.push_back(val);
}
sort(ar.begin(), ar.end());
for (std::vector<int>::iterator it = ar.begin() ; it != ar.end(); ++it)
Report(*it);
std::cout << endl;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1720 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |