ro0opf

void selectionSort(int arr[], int n) {
	int min_idx;
	for (int i = 0; i < n - 1; i++) {
		min_idx = i;
		for (int j = i + 1; j < n; j++) {
			res.compare = res.compare+1;
			if (arr[j] < arr[min_idx]) {
				min_idx = j;
			}
		}

ro0opf

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <cstring>
#include <map>
#include <stack>
#include <functional>
#include <set>

ro0opf

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <cstring>
#include <map>
#include <stack>
#include <functional>
#include <set>

ro0opf

import requests
from bs4 import BeautifulSoup as bs
import time
import multiprocessing as mp
import os
import urllib.request
 
def _get(keyword):
    html = requests.get('https://search.naver.com/search.naver?where=image&sm=tab_jum&query=' + keyword).content
    soup = bs(html, 'html.parser')

ro0opf

import requests
from bs4 import BeautifulSoup as bs
import time
import multiprocessing as mp
import os


def _get(index, title_list, score_list):
    html = requests.get('https://www.jobplanet.co.kr/companies/' + str(index)).content
    soup = bs(html, 'html.parser')

ro0opf

import requests
from bs4 import BeautifulSoup as bs
import time
import multiprocessing as mp
import os


 def _get(index, title_list, score_list):
    html = requests.get('https://www.jobplanet.co.kr/companies/' + str(index)).content
    soup = bs(html, 'html.parser')

ro0opf

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <cstring>
#include <map>
#include <stack>
#include <functional>
#include <set>

ro0opf

#include <iostream>  
#include <algorithm>  
#include <string>  
#include <vector>  
#include <queue>  
#include <cstring>  
#include <map>  
#include <stack>  
#include <functional>  
#include <set>