# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1611 | 2013-07-10T13:16:56 Z | ho94949 | 짝수 정렬 (tutorial3) | C++ | 0 ms | 0 KB |
#include<algorithm> #include<vector> using namespace std; void sort_even(int N, int* A){ vector<int> evens; for(int i=0;i<N;i++){ if(A[i]%2==0) evens.push_back(A[i]); } sort(evens.begin(),evens.end()); for(int i=0;i<evens.size();i++){ Report(evens[i]); } return; }