Codeforces Round #341 (Div. 2)(A)模拟
来源:互联网 发布:淘宝商品详情图做法 编辑:程序博客网 时间:2024/05/16 11:26
题意:给你n个数字,求他们的偶数最大和。
题解:排序直接模拟一下
#include <set>#include <map>#include <list> #include <cmath> #include <queue> #include <vector>#include <cstdio> #include <string> #include <cstring>#include <iomanip> #include <iostream> #include <sstream>#include <algorithm>#define LL long long #define inf 0x3f3f3f3f3f3f3f3fusing namespace std;#define N 1000000vector<LL>v;LL a[N];int main(){#ifdef CDZSCfreopen("i.txt","r",stdin);#endifint n;while(~scanf("%d",&n)){LL x,mx=inf;int num=0;LL sum=0;for(int i=0;i<n;i++){scanf("%lld",&x);sum+=x;if(x&1){mx=min(mx,x);num++;}}if(num&1)sum-=mx;printf("%lld\n",sum);}return 0;}
0 0
- Codeforces Round #341 (Div. 2)(A)模拟
- Codeforces Round #346 (Div. 2) -A. Round House(模拟)
- Codeforces Round #297 (Div. 2) A(模拟)
- Codeforces Round #340 (Div. 2)(A) 模拟
- Codeforces Round #107 (Div. 2) A(简单模拟)
- Codeforces Round #109 (Div. 2) A (简单模拟)
- Codeforces Round #281 (Div. 2)A(构造+暴力模拟)
- Codeforces Round #328 (Div. 2)Problem A. PawnChess(模拟)
- Codeforces Round #335 (Div. 2) (A)模拟
- Codeforces Round #294 (Div. 2)(A)模拟
- Codeforces Round #246 (Div. 2)(A)模拟
- Codeforces Round #247 (Div. 2)(A)模拟
- Codeforces Round #321 (Div. 2)(A)模拟
- Codeforces Round #273 (Div. 2)(A)模拟
- Codeforces Round #345 (Div. 2)-A. Joysticks(模拟)
- Codeforces Round #277 (Div. 2)(A)模拟,打表
- Codeforces Round #346 (Div. 2)(A)模拟
- Codeforces Round #349 (Div. 2)(A)模拟
- JAVA WEB学习路线
- UITableViewCell的循环利用 - 在storyboard里
- 设计模式:策略模式
- HDU1242 rescue 【BFS+优先队列】
- Androidx学习笔记(49)--- Activity的跳转
- Codeforces Round #341 (Div. 2)(A)模拟
- hdu3081 Marriage Match II
- sdk不能更新
- 程序员必知的一些快捷键!
- Codeforces Round #341 (Div. 2)(B)数学
- JQury中设置元素滑动(slideUp/slideDown/slideToggle)方法
- SPDY与HTTP2.0
- 《笨办法学Python》 第32课手记
- 【组合数学】[HNOI2008][HYSBZ/BZOJ1008]越狱