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. vector<int> a;
  31.  
  32. int consistency(int n){
  33.  
  34. vector<int> odd;
  35. int sum = 0;
  36.  
  37. for(int i=0; i<n; i++){
  38. if(a[i] & 1) odd.push_back(a[i]);
  39. else sum += a[i];
  40. }
  41.  
  42. sort(begin(odd), end(odd));
  43.  
  44. int maxSum = 0;
  45. for(int i=odd.size()-1; i>=0; i -= 2){
  46. int val = sum + odd[i] + odd[i-1];
  47. maxSum = max(maxSum, val);
  48. }
  49.  
  50. return maxSum;
  51.  
  52. }
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68. int practice(int n){
  69.  
  70.  
  71. return 0;
  72. }
  73.  
  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.  
  95. int32_t main() {
  96. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  97.  
  98. int t = 1;
  99. // cin >> t;
  100. while (t--) {
  101. solve();
  102. }
  103.  
  104. return 0;
  105. }
Success #stdin #stdout 0s 5320KB
stdin
7
2 3 6 -5 10 1 1
stdout
22