제출 #150316

#제출 시각아이디문제언어결과실행 시간메모리
150316distutpia (#200)최적의 팀 구성 (FXCUP4_squad)C++17
0 / 100
3100 ms10872 KiB
#include "squad.h"
int siz;
std::vector<int> A1;
std::vector<int> D1;
std::vector<int> P1;
void Init(std::vector<int> A, std::vector<int> D, std::vector<int> P){
	int N = A.size();
	siz=N;
	A1=A;
	D1=D;
	P1=P;
}

long long BestSquad(int X, int Y){
	long long int ans=0;
	for(int i=0; i<siz; i++){
		for(int j=0; j<siz; j++){
			if(i==j){
				continue;
			}
			if(ans<(long long)(A1[i]+D1[j])*(long long)X+(long long)(P1[i]+P1[j])*(long long)Y){
				ans=(long long)(A1[i]+D1[j])*(long long)X+(long long)(P1[i]+P1[j])*(long long)Y;
			}
		}
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...