oj.uz

Submission #145835

# Submission time Handle Problem Language Result Execution time Memory
145835 2019-08-21T07:06:53 Z wesley2003 짝수 정렬 (tutorial3) C++14
100 / 100
 3 ms 376 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include "grader.h"
using namespace std;
 
void sort_even(int n, int *arr) {
	int a[1200],cnt=0;
 
	for (int i = 0; i < n; i++)
		if (arr[i] % 2 == 0){
          a[cnt]=arr[i];
          cnt++;
        }
	
	sort(a, a+cnt);
	for (int i=0;i<cnt;i++)
		Report(a[i]);
}

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 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 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct

Subtask #2
60.0 / 60.0

# 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 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct