Omenat

#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;

int v[111];

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin>>n;
	vector<pair<ll, int> > p(n);
	for (int i=0;i<n;i++){
		cin>>p[i].F;
		p[i].S=i;
	}
	sort(p.rbegin(), p.rend());
	ll p1=0;
	ll p2=0;
	for (int i=0;i<n;i++){
		if (p1<p2){
			p1+=p[i].F;
			v[p[i].S]=1;
		}
		else{
			p2+=p[i].F;
			v[p[i].S]=2;
		}
	}
	for (int i=0;i<n;i++){
		cout<<v[i]<<" ";
	}
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED