# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
15642 |
2015-07-13T19:44:43 Z |
ggoh |
버블 정렬 (OJUZ10_bubblesort) |
C++ |
|
92 ms |
5828 KB |
#include<cstdio>
#include<set>
int a,b,i,x;
std::multiset<int>S;
std::multiset<int>::iterator t;
main()
{
scanf("%d%d",&a,&b);
for(i=0;i<=b;i++)
{
scanf("%d",&x);
S.insert(x);
}
for(;!S.empty();i++)
{
t=S.begin();
printf("%d ",*t);
S.erase(t);
if(i<a)scanf("%d",&x),S.insert(x);
}
}
# |
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 |
# |
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 |
Incorrect |
1 ms |
1208 KB |
Output isn't 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 |
Correct |
0 ms |
1208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
56 ms |
2528 KB |
Output is correct |
2 |
Correct |
37 ms |
2264 KB |
Output is correct |
3 |
Correct |
0 ms |
1208 KB |
Output is correct |
4 |
Correct |
73 ms |
3980 KB |
Output is correct |
5 |
Correct |
43 ms |
1208 KB |
Output is correct |
6 |
Correct |
57 ms |
3188 KB |
Output is correct |
7 |
Incorrect |
81 ms |
5828 KB |
Output isn't correct |
8 |
Correct |
0 ms |
1208 KB |
Output is correct |
9 |
Correct |
92 ms |
3452 KB |
Output is correct |
10 |
Correct |
49 ms |
2132 KB |
Output is correct |
11 |
Correct |
0 ms |
1208 KB |
Output is correct |
12 |
Correct |
21 ms |
1208 KB |
Output is correct |
13 |
Correct |
52 ms |
2000 KB |
Output is correct |
14 |
Correct |
60 ms |
2792 KB |
Output is correct |
15 |
Correct |
0 ms |
1208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
65 ms |
5828 KB |
Output isn't correct |
2 |
Correct |
45 ms |
1208 KB |
Output is correct |
3 |
Correct |
54 ms |
2792 KB |
Output is correct |
4 |
Correct |
0 ms |
1208 KB |
Output is correct |
5 |
Correct |
35 ms |
1208 KB |
Output is correct |
6 |
Correct |
46 ms |
2000 KB |
Output is correct |
7 |
Correct |
59 ms |
2264 KB |
Output is correct |
8 |
Correct |
36 ms |
1208 KB |
Output is correct |
9 |
Correct |
55 ms |
3188 KB |
Output is correct |
10 |
Correct |
56 ms |
1208 KB |
Output is correct |
11 |
Correct |
60 ms |
3980 KB |
Output is correct |
12 |
Correct |
70 ms |
2528 KB |
Output is correct |
13 |
Correct |
65 ms |
3452 KB |
Output is correct |
14 |
Correct |
55 ms |
2132 KB |
Output is correct |
15 |
Correct |
0 ms |
1208 KB |
Output is correct |