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 <vector>
using namespace std;
const int maxn = 1005;
int n, s;
int a[maxn];
void fastIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int main()
{
fastIO();
cin >> n >> s;
for (int i = 1; i <= n; ++i)
{
cin >> a[i];
}
vector<pair<int, int>> ans;
while (true)
{
bool has_swap = false;
for (int i = 1; i < n; ++i)
{
if (a[i] > a[i + 1])
{
ans.push_back(make_pair(i, i + 1));
ans.push_back(make_pair(i + 1, i));
ans.push_back(make_pair(i, i + 1));
swap(a[i], a[i + 1]);
has_swap = true;
}
}
if (has_swap == false)
{
break;
}
}
cout << ans.size() << endl;
for (auto [x, y] : ans)
{
cout << x << ' ' << y << "\n";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |