Pagini recente » Cod sursa (job #3262371) | Cod sursa (job #2655174) | Cod sursa (job #2021267) | Cod sursa (job #1934881) | Cod sursa (job #2418223)
#include <bits/stdc++.h>
using namespace std;
ifstream in("congr.in");
ofstream out("congr.out");
const int N = 300005;
pair<int,int> v[2*N];
int main()
{
int n;
long long s = 0;
in >> n;
for (int i = 1; i<=2*n-1; i++)
{
in >> v[i].first;
v[i].second = i;
if (i<=n)
s+=v[i].first;
}
srand(time(0));
while (s%n)
{
int k1 = rand()%n+1, k2 = rand()%(n-1)+n+1;
s-=v[k1].first;
s+=v[k2].first;
swap(v[k1],v[k2]);
}
for (int i = 1; i<=n; i++)
out << v[i].second << " ";
}