http://www.cnblogs.com/wenruo/p/5176375.html
A. Wet Shark and Odd and Even
题意：输入n个数，选择其中任意个数，使和最大且为奇数。
题解：算出所有数的和，如果奇数的个数为奇数个，则减去最小的奇数，否则不用处理。
1 #include <bits/stdc++.h> 2 using namespace std; 3 #define PI acos(-1.0) 4 #define EXP exp(1.0) 5 #define ESP 1E-6 6 #define clr(x,c) memset(x,c,sizeof(x)) 7 typedef long long ll; 8 9 using namespace std; 10 int main() 11 { 12 int n; 13 int cnt = 0; int minn = 1000000000; 14 int val; 15 ll ans = 0; 16 scanf("%d", &n); 17 for (int i = 0; i < n; ++i) { 18 scanf("%d", &val);ans += val; 19 if (val % 2 == 1) { 20 cnt++; 21 minn = min(minn, val); 22 } 23 } 24 if (cnt % 2 == 1) ans -= minn; 25 cout << ans; 26 return 0; 27 }