oj.uz

Submission #18930

# Submission time Handle Problem Language Result Execution time Memory
18930 2016-02-16T13:03:54 Z chan492811 버블 정렬 (OJUZ10_bubblesort) C++
0 / 100
 47 ms 1980 KB 
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;

int n,m;
priority_queue<int,vector<int>,greater<int> > pq;

int main(){
    int i,a;
    scanf("%d %d",&n,&m);
    for(i=0;i<=m;i++) scanf("%d",&a),pq.push(a);
    for(i=m+1;i<n;i++){
        printf("%d ",pq.top()); pq.pop(); scanf("%d",&a); pq.push(a);
    }
    while(!pq.empty()) printf("%d ",pq.top()),pq.pop();
    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 Incorrect 0 ms 1208 KB Output isn't correct
7 Correct 0 ms 1208 KB Output is 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 Incorrect 0 ms 1208 KB Output isn't correct
7 Correct 1 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 Correct 0 ms 1208 KB Output is correct

Subtask #3
0.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 1340 KB Output is correct
2 Incorrect 43 ms 1980 KB Output isn't correct
3 Correct 31 ms 1208 KB Output is correct
4 Correct 44 ms 1208 KB Output is correct
5 Correct 35 ms 1340 KB Output is correct
6 Correct 29 ms 1596 KB Output is correct
7 Correct 36 ms 1208 KB Output is correct
8 Correct 47 ms 1596 KB Output is correct
9 Correct 42 ms 1596 KB Output is correct
10 Correct 22 ms 1208 KB Output is correct
11 Correct 15 ms 1596 KB Output is correct
12 Correct 32 ms 1208 KB Output is correct
13 Correct 36 ms 1208 KB Output is correct
14 Correct 34 ms 1340 KB Output is correct
15 Correct 15 ms 1340 KB Output is correct

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 1208 KB Output is correct
2 Correct 0 ms 1596 KB Output is correct
3 Correct 0 ms 1208 KB Output is correct
4 Correct 31 ms 1596 KB Output is correct
5 Incorrect 46 ms 1980 KB Output isn't correct
6 Correct 46 ms 1596 KB Output is correct
7 Correct 46 ms 1340 KB Output is correct
8 Correct 32 ms 1208 KB Output is correct
9 Correct 0 ms 1208 KB Output is correct
10 Correct 35 ms 1208 KB Output is correct
11 Correct 0 ms 1596 KB Output is correct
12 Correct 42 ms 1340 KB Output is correct
13 Correct 43 ms 1340 KB Output is correct
14 Correct 33 ms 1340 KB Output is correct
15 Correct 37 ms 1208 KB Output is correct