Skip to content

Instantly share code, notes, and snippets.

Embed
What would you like to do?
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
using pii = pair<int, int>;
using l = long;
using ll = long long;
using ull = unsigned long long;
void solve();
#define MEASURE_TIME(function) \
high_resolution_clock::time_point t1 = high_resolution_clock::now(); \
{ function; } \
high_resolution_clock::time_point t2 = high_resolution_clock::now(); \
const auto duration = duration_cast<milliseconds>(t2 - t1).count(); \
cout.flush(); \
cerr << "--------------" << endl; \
cerr << "Elapsed Time: " << duration << "ms" << endl; \
cerr << "--------------" << endl;
int main() {
MEASURE_TIME({ solve(); })
return 0;
}
//------------PROBLEM CODE-------------
void solve() {
int n, m;
cin >> n >> m;
vector<pii> N(n);
vector<pii> M(m);
for (int i = 0; i < n; i++) {
cin >> N[i].first;
N[i].second = i;
}
for (int i = 0; i < m; i++) {
cin >> M[i].first;
M[i].second = i;
}
auto cmp = [](const auto a, const auto b) {
return (a.first < b.first);
};
sort(begin(N), end(N), cmp);
sort(begin(M), end(M), cmp);
const int bestn = N[N.size() - 1].second;
for (unsigned i = 0; i < M.size(); i++)
cout << bestn << " " << M[i].second << endl;
for (unsigned i = 0; i < N.size(); i++)
if (N[i].second != bestn)
cout << N[i].second << " " << M[0].second << endl;
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.