oj.uz

Submission #15644

# Submission time Handle Problem Language Result Execution time Memory
15644 2015-07-13T19:48:16 Z ggoh 버블 정렬 (OJUZ10_bubblesort) C++
100 / 100
 81 ms 6224 KB 
#include<cstdio>
#include<set>
int a,b,i,x[100001];
std::multiset<int>S;
std::multiset<int>::iterator t;
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++)
    {
    	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 1604 KB Output is correct
2 Correct 0 ms 1604 KB Output is correct
3 Correct 0 ms 1604 KB Output is correct
4 Correct 0 ms 1604 KB Output is correct
5 Correct 0 ms 1604 KB Output is correct
6 Correct 0 ms 1604 KB Output is correct
7 Correct 0 ms 1604 KB Output is correct

Subtask #2
23.0 / 23.0

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

Subtask #3
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 1604 KB Output is correct
2 Correct 58 ms 2396 KB Output is correct
3 Correct 49 ms 3584 KB Output is correct
4 Correct 60 ms 3848 KB Output is correct
5 Correct 81 ms 3188 KB Output is correct
6 Correct 0 ms 1604 KB Output is correct
7 Correct 49 ms 1604 KB Output is correct
8 Correct 77 ms 4376 KB Output is correct
9 Correct 57 ms 2924 KB Output is correct
10 Correct 38 ms 2660 KB Output is correct
11 Correct 0 ms 1604 KB Output is correct
12 Correct 15 ms 1604 KB Output is correct
13 Correct 47 ms 2528 KB Output is correct
14 Correct 76 ms 6224 KB Output is correct
15 Correct 35 ms 1604 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 4376 KB Output is correct
2 Correct 65 ms 3188 KB Output is correct
3 Correct 56 ms 1604 KB Output is correct
4 Correct 0 ms 1604 KB Output is correct
5 Correct 59 ms 3848 KB Output is correct
6 Correct 35 ms 1604 KB Output is correct
7 Correct 56 ms 3584 KB Output is correct
8 Correct 36 ms 1604 KB Output is correct
9 Correct 54 ms 2396 KB Output is correct
10 Correct 53 ms 2924 KB Output is correct
11 Correct 33 ms 1604 KB Output is correct
12 Correct 75 ms 6224 KB Output is correct
13 Correct 53 ms 2528 KB Output is correct
14 Correct 0 ms 1604 KB Output is correct
15 Correct 26 ms 2660 KB Output is correct