Submission #34164095

---

Source Code Expand

// Problem: A - Three Cards
// Contest: AtCoder - AtCoder Regular Contest 146
// URL: https://atcoder.jp/contests/arc146/tasks/arc146_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
typedef long long ll;
#define rep(i, a, b) for(int i = (a); i <= (b); i ++)
#define per(i, a, b) for(int i = (a); i >= (b); i --)
#define Ede(i, u) for(int i = head[u]; i; i = e[i].nxt)
using namespace std;

inline int read() {
	int x = 0, f = 1; char c = getchar();
	while(c < '0' || c > '9') f = (c == '-') ? - 1 : 1, c = getchar();
	while(c >= '0' && c <= '9') x = x * 10 + c - 48, c = getchar();
	return x * f;
}

const int N = 2e5 + 10;
int n, a[N];

int main() {
	n = read();
	rep(i, 1, n) a[i] = read();
	sort(a + 1, a + n + 1);
	int b[3]; b[0] = 0, b[1] = 1, b[2] = 2;
	ll ans = 0;
	do {
		ll cur = 0;
		rep(i, 0, 2) {
			int o = a[n - b[i]], c = 1;
			while(o) o /= 10, c *= 10;
			cur = cur * c + a[n - b[i]];
		}
		ans = max(ans, cur);
	} while(next_permutation(b, b + 3));
	printf("%lld\n", ans);
	return 0;
}

Submission Info

Judge Result