oj.uz

Submission #19109

# Submission time Handle Problem Language Result Execution time Memory
19109 2016-02-18T11:49:18 Z Namnamseo 버블 정렬 (OJUZ10_bubblesort) C++14
0 / 100
 281 ms 1980 KB 
#include <cstdio>
#include <queue>
using namespace std;
int n,k,buf;
priority_queue<int> pq;
queue<int> q;
int main()
{
    scanf("%d%d",&n,&k);
    for(int i=0;i<=k;++i) scanf("%d",&buf), pq.push(-buf);
    for(;pq.size();){
        printf("%d ",-pq.top()); pq.pop();
        if(scanf("%d",&buf)==1) pq.push(-buf);
    }
    return 0;
}

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1208 KB Output is correct
2 Correct 0 ms 1208 KB Output is correct
3 Correct 0 ms 1208 KB Output is correct
4 Correct 0 ms 1208 KB Output is correct
5 Correct 0 ms 1208 KB Output is correct
6 Correct 0 ms 1208 KB Output is correct
7 Incorrect 0 ms 1208 KB Output isn't correct

Subtask #2
0.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1208 KB Output is correct
2 Correct 0 ms 1208 KB Output is correct
3 Correct 0 ms 1208 KB Output is correct
4 Correct 0 ms 1208 KB Output is correct
5 Correct 0 ms 1208 KB Output is correct
6 Correct 0 ms 1208 KB Output is correct
7 Correct 0 ms 1208 KB Output is correct
8 Correct 0 ms 1208 KB Output is correct
9 Correct 0 ms 1208 KB Output is correct
10 Incorrect 11 ms 1208 KB Output isn't correct

Subtask #3
0.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 1596 KB Output is correct
2 Correct 276 ms 1596 KB Output is correct
3 Correct 81 ms 1340 KB Output is correct
4 Correct 42 ms 1208 KB Output is correct
5 Correct 83 ms 1340 KB Output is correct
6 Correct 16 ms 1208 KB Output is correct
7 Incorrect 200 ms 1980 KB Output isn't correct
8 Correct 108 ms 1596 KB Output is correct
9 Correct 199 ms 1596 KB Output is correct
10 Correct 29 ms 1208 KB Output is correct
11 Correct 40 ms 1208 KB Output is correct
12 Correct 39 ms 1208 KB Output is correct
13 Correct 29 ms 1208 KB Output is correct
14 Correct 108 ms 1340 KB Output is correct
15 Correct 62 ms 1340 KB Output is correct

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1208 KB Output is correct
2 Correct 123 ms 1596 KB Output is correct
3 Incorrect 281 ms 1980 KB Output isn't correct
4 Correct 108 ms 1340 KB Output is correct
5 Correct 35 ms 1208 KB Output is correct
6 Correct 124 ms 1596 KB Output is correct
7 Correct 126 ms 1340 KB Output is correct
8 Correct 48 ms 1340 KB Output is correct
9 Correct 150 ms 1596 KB Output is correct
10 Correct 0 ms 1208 KB Output is correct
11 Correct 17 ms 1208 KB Output is correct
12 Correct 25 ms 1208 KB Output is correct
13 Correct 72 ms 1340 KB Output is correct
14 Correct 0 ms 1208 KB Output is correct
15 Correct 268 ms 1596 KB Output is correct