제출 #1332473

#제출 시각아이디문제언어결과실행 시간메모리
1332473opeleklanos메기 농장 (IOI22_fish)C++20
0 / 100
49 ms7260 KiB
#include <iostream>
#include <vector>
using namespace std;


#define ll long long 

ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w){
    ll ans0 = 0;
    ll ans1 = 0;
    for(int i = 0; i<m; i++){
        if(x[i] == 0) ans0 += (ll)w[i];
        else ans1+=(ll)w[i];
    }
    return max(ans0, ans1);
}
#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...