# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
679685 | 2023-01-09T01:23:06 Z | boyliguanhan | Catfish Farm (IOI22_fish) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h> using namespace std; long long max_weights(int n, int m, int x[], int y[], int w[]){ int res[2]; for(int i = 0; i < n; i++) res[x[i]%2]+=w[i]; return max(res[0], res[1]); }