전체 글 (105) 썸네일형 리스트형 [프로그래머스]디스크 컨트롤러 #include #include #include #include using namespace std; int solution(vector jobs) { int answer = 0; sort(jobs.begin(), jobs.end()); int pos = -1; int count = -1, idx = 0; vector store; priority_queue temp; while(++pos [프로그래머스]섬 연결하기 넘 어려웠다./.... #include #include #include #include using namespace std; int solution(int n, vector costs) { int answer = 0; int min = INT_MAX; int y, x; vector check(n); vector map(n, vector(n)); for(int idx = 0; idx [프로그래머스]이중우선순위큐 #include #include #include using namespace std; vector solution(vector operations) { vector answer; priority_queue maxQ; priority_queue minQ; for(int idx = 0; idx [미완]디스크 분할 #include #include #include #include #include #include using namespace std; int solution(vector jobs) { int answer = 0; int pos = -1; int count = 0, idx = 0; vector store; priority_queue temp; while(++pos [프로그래머스]라면공장 date가 0일 때 고려해서 stock--; #include #include #include using namespace std; int solution(int stock, vector dates, vector supplies, int k) { int answer = 0; dates.insert(dates.end(), k); dates.insert(dates.begin(), 0); supplies.insert(supplies.end(), 0); supplies.insert(supplies.begin(), 0); priority_queue store; stock--; for(int idx = 1; idx [프로그래머스]라면공장 #include #include #include #include using namespace std; vector allDates;vector allSupplies;bool check[100001];int limit;int result; void DFS(int stock, int dayCount, int count) { if(dayCount == allDates.size()) { if (limit - allDates[dayCount - 1] count ? count : result; } else if (limit - allDates[dayCount - 1] count + 1 ? count + 1 : result; } return; } if(stock - (allDates[dayCount] - allDat.. [프로그래머스]여행경로 #include #include #include using namespace std; int tiketsLen; int count = 0; bool check[10001]; string airport[10001]; vector store; vector allTickets; void DFS(string curPort, int count) { if(count == tiketsLen) { vector temp(count + 1); for(int idx = 0; idx [프로그래머스]단어 변환 #include #include #include #include using namespace std; bool check[51]; int solution(string begin, string target, vector words) { int answer = 0; fill(check, check + 51, false); queue mainQ; mainQ.push( { begin, 0 }); while (!mainQ.empty()) { string word = mainQ.front().first; int count = mainQ.front().second; mainQ.pop(); if(!word.compare(target)) { answer = count; break; } else if(count > wor.. 이전 1 2 3 4 5 6 7 8 ··· 14 다음