fork download
  1. import java.util.HashMap;
  2. import java.util.Scanner;
  3.  
  4. public class Main {
  5. public static long sol(long v) {
  6. long sum = 0;
  7. while (v != 0) {
  8. sum = sum + v % 10;
  9. v = v / 10;
  10. }
  11. return sum;
  12. }
  13.  
  14. public static void main(String[] args) {
  15. Scanner scanner = new Scanner(System.in);
  16.  
  17. int n = scanner.nextInt();
  18. long[] b = new long[n + 1];
  19.  
  20. int i = 1;
  21. while (i <= n) {
  22. b[i] = scanner.nextLong();
  23. i++;
  24. }
  25.  
  26. HashMap<Long, Long> kk = new HashMap<>();
  27. i = 1;
  28. long answer = -1;
  29. long pairs_cnt = 0;
  30.  
  31. while (i <= n) {
  32. if (kk.containsKey(sol(b[i]))) {
  33. long pp = b[i] + kk.get(sol(b[i]));
  34. // answer = Math.max(answer, pp);
  35. if(pp > answer){
  36. answer = pp;
  37. pairs_cnt = 1;
  38. }
  39. else if(pp == answer){
  40. pairs_cnt++;
  41. }
  42. kk.put(sol(b[i]), Math.max(kk.get(sol(b[i])), b[i]));
  43. } else {
  44. kk.put(sol(b[i]), b[i]);
  45. }
  46. i++;
  47. }
  48.  
  49. System.out.println(answer);
  50. System.out.println(pairs_cnt);
  51. }
  52. }
  53.  
Success #stdin #stdout 0.18s 56588KB
stdin
4
51 17 71 42
stdout
93
1