fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. inline int power(int a, int b) {
  6.     int x = 1;
  7.     while (b) {
  8.         if (b & 1) x *= a;
  9.         a *= a;
  10.         b >>= 1;
  11.     }
  12.     return x;
  13. }
  14.  
  15.  
  16. const int M = 1000000007;
  17. const int N = 3e5+9;
  18. const int INF = 2e9+1;
  19. const int LINF = 2000000000000000001;
  20.  
  21. //_ ***************************** START Below *******************************
  22.  
  23.  
  24.  
  25. vector<int> a;
  26.  
  27. int digitSum(int x){
  28. 	int sum = 0;
  29. 	while(x){
  30. 		sum += x%10;
  31. 		x /= 10;
  32. 	}
  33. 	return sum;
  34. }
  35.  
  36. void consistency(int n) {
  37.  
  38. 	unordered_map<int,int>mp;
  39.  
  40. 	int ans = -1;
  41. 	for(int i=0; i<n; i++){
  42. 		int sum = digitSum(a[i]);
  43.  
  44. 		if(mp.count(sum)){
  45. 			ans = max(ans, a[i] + mp[sum]);
  46. 		}
  47. 		mp[sum] = max(mp[sum], a[i]);
  48. 	}
  49.  
  50.  
  51. 	cout << ans << endl;
  52.  
  53. }
  54.  
  55. void solve() {
  56.  
  57.     int n;
  58.     cin >> n;
  59.     a.resize(n);
  60.     for(int i=0; i<n; i++) cin >> a[i];
  61.  
  62.     consistency(n) ;
  63.  
  64. }
  65.  
  66.  
  67.  
  68.  
  69.  
  70. int32_t main() {
  71.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  72.  
  73.     int t = 1;
  74.     cin >> t;
  75.     while (t--) {
  76.         solve();
  77.     }
  78.  
  79.     return 0;
  80. }
Success #stdin #stdout 0s 5324KB
comments (?)
stdin
copy 
3
4
51 71 17 42
3
42 33 60
3
51 32 43
stdout
copy 
93
102
-1
https://ideone.com/1agL3d
language:
C++14 (gcc 8.3)
created:
6 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!