제출 #1223315

#제출 시각아이디문제언어결과실행 시간메모리
1223315brinton메기 농장 (IOI22_fish)C++20
0 / 100
50 ms7240 KiB
#include "fish.h" #include <bits/stdc++.h> using namespace std; long long max_weights(int N, int M, vector<int> X, vector<int> Y,vector<int> W) { long long a = 0,b = 0; for(int i = 0;i < M;i++){ if(X[i] == 0) a+=W[i]; else b += W[i]; } return max(a,b); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...