인프런 커뮤니티 질문&답변

function solution(m, product){
                let answer=0;
                let n=product.length;
                for(let i=0; i<n; i++){
			let sortedSaledArr = product.slice().map((v,idx)=>{
				if(idx===i) return [v[0]/2, v[1]];
				return v;
			}).sort((a,b)=>a.reduce((p,c)=>p+c)-b.reduce((p,c)=>p+c));
			let sum=0;
			for(let j=0; j<n; j++){
				let updated = sum+sortedSaledArr[j].reduce((p,c)=>p+c);
				if(updated>m){
					answer=Math.max(answer, j);
					break;
				}
				sum=updated;
			}
		}
                return answer;
            }
			
            let arr=[[6, 6], [2, 2], [4, 3], [4, 5], [10, 3]];
            console.log(solution(28, arr));