AtCoder Regular Contest 158 C - All Pair Digit Sums

#include<bits/stdc++.h>
using namespace std;
#define ll long long 
#define N 1000000
int n;
ll a[N];
ll res,ans;

ll get_num(ll m){
	m=pow(10,m);
	ll tmp=0;
	vector<ll>vec;
	for(int i=1;i<=n;i++){
		ll cur=a[i]%m;
		vec.push_back(cur);
	}
	sort(vec.begin(),vec.end());
	int l=0,r=n-1;
	for(l=0;l<n;l++){
		while(r>0 && vec[r-1]+vec[l]>=m){
			r--;
		}
		if(vec[r]+vec[l]<m) continue;
		tmp+=(n-1-r+1);
	}
	return tmp;
}

signed main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	ans=res=0;
	for(int i=1;i<=16;i++){
		res+=get_num(i);
	}
	res*=(9ll);
	for(int i=1;i<=n;i++){
		while(a[i]){
			ans+=(a[i]%10);
			a[i]/=10;
		}
	}
	ans*=(2ll*n);
	ans-=res;
	cout<<ans<<endl;
}