zsj (新壹街校区-周士杰)

UID: 1074, 注册于 2022-2-20 16:25:28, 最后登录于 2024-8-24 15:56:53, 目前离线.

解决了 294 道题目，RP: 242.29 (No. 121)

个人简介

play: MC:https://www.crazygames.com/

study: 算法（索引） 01背包 https://world.xiaomawang.com/w/playground-python/647415

完全背包 https://world.xiaomawang.com/w/playground-python/703493

深搜 https://world.xiaomawang.com/w/playground-python/624437

广搜 https://world.xiaomawang.com/w/playground-python/604092

二分查找 https://world.xiaomawang.com/w/playground-python/534589

CSP初赛知识点(索引) 位运算： http://ac.cqxiaomawang.com:8888/d/JX_230711_02/homework/64b74a4813accdb4daf9837e

二叉树性质: http://ac.cqxiaomawang.com:8888/d/JX_230711_02/homework/64b2044713accdb4daf0276f

图的理论知识 https://world.xiaomawang.com/w/playground-python/739884 http://ac.cqxiaomawang.com:8888/d/JX_230711_02/homework/64b131ff13accdb4daef625c

字符串: https://world.xiaomawang.com/w/playground-python/739093 http://ac.cqxiaomawang.com:8888/d/JX_230711_02/homework/64b006a213accdb4daec307a

数据结构（索引） deque（双端队列） https://world.xiaomawang.com/w/playground-python/742853

vector(动态数组)常用函数 https://blog.csdn.net/csg999/article/details/103898870/

queue(队列) https://world.xiaomawang.com/w/playground-python/743850

stack(栈) deque（双端队列） https://world.xiaomawang.com/w/playground-python/742853

vector(动态数组)常用函数 https://blog.csdn.net/csg999/article/details/103898870/

queue(队列) https://world.xiaomawang.com/w/playground-python/743850

stack(栈) https://blog.csdn.net/weixin_44162361/article/details/115868909?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522168974739016782425113096%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=168974739016782425113096&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~top_positive~default-1-115868909-null-null.142^v89^control_2,239^v2^insert_chatgpt&utm_term=栈&spm=1018.2226.3001.4449

#include<bits/stdc++.h> using namespace std; long long a1[1000001],a2[1000001],cnt1,cnt2,sum; bool cmp(int x,int y){ return x>y; } int main(){ freopen("num.in","r",stdin); freopen("num.out","w",stdout); int n,x; cin>>n; for(int i=1;i<=n;++i){ cin>>x; if(x%2)a1[++cnt1]=x; else a2[++cnt2]=x; } sort(a1+1,a1+cnt1+1,cmp); sort(a2+1,a2+cnt2+1,cmp); int len=min(cnt1,cnt2); for(int i=1;i<=len;++i){ if(a1[i]+a2[i]<=0)break; sum+=a1[i]+a2[i]; } cout<<sum; return 0; }
最近活动