Problem
Problem URL : 최솟값 만들기
[1] Answer Code (18. 07. 25)
int solution(vector<int> A, vector<int> B){
int answer = 0;
sort(A.begin(), A.end());
sort(B.rbegin(), B.rend());
int size = A.size();
for(int i=0; i<size; i++){
answer += (A[i] * B[i] );
}
return answer;
}
[1] Answer Code (18. 07. 25)
- 무난 ~