fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30.  
  31. vector<int> a;
  32.  
  33. int digitSum(int x){
  34. int sum = 0;
  35. while(x){
  36. sum += x%10;
  37. x /= 10;
  38. }
  39. return sum;
  40. }
  41.  
  42. int consistency(int n) {
  43.  
  44. unordered_map<int,int>mp;
  45.  
  46. int ans = -1;
  47. for(int i=0; i<n; i++){
  48. int sum = digitSum(a[i]);
  49.  
  50. if(mp.count(sum)){
  51. ans = max(ans, a[i] + mp[sum]);
  52. }
  53. mp[sum] = max(mp[sum], a[i]);
  54. }
  55.  
  56.  
  57. return ans;
  58.  
  59. }
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70. int practice(int n){
  71.  
  72.  
  73. return 0;
  74. }
  75.  
  76.  
  77.  
  78. void solve() {
  79.  
  80. int n;
  81. cin >> n;
  82.  
  83. a.resize(n);
  84. for(int i=0; i<n; i++) cin >> a[i];
  85.  
  86. cout << consistency(n) << endl ;
  87.  
  88. }
  89.  
  90.  
  91.  
  92.  
  93.  
  94. int32_t main() {
  95. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  96.  
  97. int t = 1;
  98. cin >> t;
  99. while (t--) {
  100. solve();
  101. }
  102.  
  103. return 0;
  104. }
Success #stdin #stdout 0s 5328KB
stdin
3
4
51 71 17 42
3
42 33 60
3
51 32 43 
stdout
93
102
-1