oj.uz

Submission #15641

# Submission time Handle Problem Language Result Execution time Memory
15641 2015-07-13T19:40:47 Z ggoh 버블 정렬 (OJUZ10_bubblesort) C++
100 / 100
 85 ms 6456 KB 
#include<cstdio>
#include<set>
int a,b,i,x[160001];
std::multiset<int>S;
main()
{
    scanf("%d%d",&a,&b);
    for(i=0;i<a;i++)
    {
        scanf("%d",&x[i]);
        if(i<=b)S.insert(x[i]);
    }
    for(i=0;i<a;i++)
    {
    	std::multiset<int>::iterator t=S.begin();
    	printf("%d ",*t);
    	S.erase(t);
        if(i+b+1<a)S.insert(x[i+b+1]);
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1836 KB Output is correct
2 Correct 0 ms 1836 KB Output is correct
3 Correct 0 ms 1836 KB Output is correct
4 Correct 0 ms 1836 KB Output is correct
5 Correct 0 ms 1836 KB Output is correct
6 Correct 0 ms 1836 KB Output is correct
7 Correct 0 ms 1836 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1836 KB Output is correct
2 Correct 0 ms 1836 KB Output is correct
3 Correct 0 ms 1836 KB Output is correct
4 Correct 0 ms 1836 KB Output is correct
5 Correct 0 ms 1836 KB Output is correct
6 Correct 0 ms 1836 KB Output is correct
7 Correct 0 ms 1836 KB Output is correct
8 Correct 1 ms 1836 KB Output is correct
9 Correct 0 ms 1836 KB Output is correct
10 Correct 0 ms 1836 KB Output is correct

Subtask #3
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 2628 KB Output is correct
2 Correct 41 ms 3816 KB Output is correct
3 Correct 59 ms 3420 KB Output is correct
4 Correct 49 ms 3156 KB Output is correct
5 Correct 17 ms 1836 KB Output is correct
6 Correct 74 ms 6456 KB Output is correct
7 Correct 24 ms 1836 KB Output is correct
8 Correct 39 ms 1836 KB Output is correct
9 Correct 65 ms 2892 KB Output is correct
10 Correct 53 ms 2760 KB Output is correct
11 Correct 0 ms 1836 KB Output is correct
12 Correct 42 ms 1836 KB Output is correct
13 Correct 82 ms 4608 KB Output is correct
14 Correct 54 ms 4080 KB Output is correct
15 Correct 42 ms 1836 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 4608 KB Output is correct
2 Correct 69 ms 3156 KB Output is correct
3 Correct 10 ms 1836 KB Output is correct
4 Correct 39 ms 1836 KB Output is correct
5 Correct 0 ms 1836 KB Output is correct
6 Correct 48 ms 2628 KB Output is correct
7 Correct 49 ms 2760 KB Output is correct
8 Correct 32 ms 1836 KB Output is correct
9 Correct 85 ms 6456 KB Output is correct
10 Correct 30 ms 2892 KB Output is correct
11 Correct 39 ms 3816 KB Output is correct
12 Correct 21 ms 1836 KB Output is correct
13 Correct 70 ms 4080 KB Output is correct
14 Correct 65 ms 3420 KB Output is correct
15 Correct 53 ms 1836 KB Output is correct