# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25879 | nibnalin | Swap (BOI16_swap) | C++14 | 0 ms | 2800 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
const int maxn = int(2e5)+5;
int A[maxn];
int main(void)
{
int n;
scanf("%d", &n);
for(int i = 1;i <= n;i++) scanf("%d", &A[i]);
for(int i = 1;i <= n;i++)
{
if(i*2+1 > n) break;
if(A[i*2] < A[i] && A[i*2] < A[i*2+1])
{
swap(A[i], A[i*2]);
}
else if(A[i*2+1] < A[i] && A[i*2+1] < A[i*2])
{
swap(A[i], A[i*2+1]);
}
}
for(int i = 1;i <= n;i++) printf("%d ", A[i]);
printf("\n");
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |