# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
4737 | 2013-12-23T11:18:23 Z | ainta | 중앙값 배열 (balkan11_medians) | C++ | 99 ms | 10548 KB |
#pragma warning(disable:4996) #include<stdio.h> #include<algorithm> #include<set> using namespace std; set<int>Set; set<int>::iterator it, it2; int main() { int a, b, i, n; scanf("%d", &n); for (i = 1; i <= 2 * n - 1; i++) Set.insert(i); for (i = 1; i <= n; i++){ scanf("%d", &a); if (i == 1){ printf("%d ", a); Set.erase(Set.find(a)); b = a; continue; } if (Set.find(a) != Set.end()){ Set.erase(Set.find(a)); printf("%d ", a); if (a < b)it = Set.begin(); else it = Set.end(), it--; printf("%d ", *it); Set.erase(it); b = a; continue; } if (a <= b)it = Set.begin(); else it = Set.end(), it--; printf("%d ", *it); Set.erase(it); if (a < b)it = Set.begin(); else it = Set.end(), it--; printf("%d ", *it); Set.erase(it); b = a; } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 1176 KB | Output is correct |
2 | Correct | 0 ms | 1176 KB | Output is correct |
3 | Correct | 0 ms | 1176 KB | Output is correct |
4 | Correct | 0 ms | 1176 KB | Output is correct |
5 | Correct | 0 ms | 1176 KB | Output is correct |
6 | Correct | 0 ms | 1176 KB | Output is correct |
7 | Correct | 0 ms | 1176 KB | Output is correct |
8 | Correct | 0 ms | 1176 KB | Output is correct |
9 | Correct | 0 ms | 1176 KB | Output is correct |
10 | Correct | 0 ms | 1176 KB | Output is correct |
11 | Correct | 0 ms | 1176 KB | Output is correct |
12 | Correct | 0 ms | 1308 KB | Output is correct |
13 | Correct | 0 ms | 1308 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 1440 KB | Output is correct |
2 | Correct | 3 ms | 1572 KB | Output is correct |
3 | Correct | 6 ms | 1968 KB | Output is correct |
4 | Correct | 6 ms | 2628 KB | Output is correct |
5 | Correct | 33 ms | 4212 KB | Output is correct |
6 | Correct | 66 ms | 7248 KB | Output is correct |
7 | Correct | 99 ms | 10548 KB | Output is correct |