# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
8830 |
2014-09-20T12:10:55 Z |
xiaoyu |
짝수 정렬 (tutorial3) |
C++ |
|
0 ms |
1208 KB |
#include "grader.h"
#include <vector>
#include <algorithm>
using namespace std;
void sort_even(int N, int *A) {
vector<int> v;
int i;
for(i = 0; i < N; i++) {
if(A[i] % 2 == 0) v.push_back(A[i]);
}
sort(v.rbegin(), v.rend());
for(i=0;i<v.size();i++) Report(v[i]);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1208 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
1208 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |