쵸코쿠키의 연습장

풀이 #include #include #include #include using namespace std; vector solution(vector array, vector commands) { vector answer; int size = commands.size(); for(int i=0; i < size; i++){ vector subArray; subArray.assign( array.begin() + commands[i][0] - 1, array.begin() + commands[i][1]); sort(subArray.begin(), subArray.end()); answer.push_back( subArray[commands[i][2] - 1]); } return answer;} 결과 정확성 ..

풀이 #include #include using namespace std; int tester1[5] = {1,2,3,4,5};int tester2[8] = {2,1,2,3,2,4,2,5};int tester3[10] = {3,3,1,1,2,2,4,4,5,5}; int max(int a, int b){ return a < b ? b : a;} vector solution(vector answers) { vector answer; vector score(3); int maxScore = 0; for(int i=0; i < answers.size(); i++){ if(tester1[i % 5] == answers[i]) score[0]++; if(tester2[i % 8] == answers[i]) scor..

풀이 #include #include #include #include using namespace std; string solution(vector participant, vector completion) { std::sort(participant.begin(), participant.end()); std::sort(completion.begin(), completion.end()); int num = 0; for(int i=0; i < participant.size(); i++){ if( participant[i] != completion[i]){ return participant[i]; } } return participant[participant.size()];} 실행 결과 정확성 테스트테스트 1 ..

풀이 #include #include using namespace std; long long solution(int N) { long long answer = 0; vector check(N+1); for(int i=2;i num; cout