//https://www.acmicpc.net/problem/2751 #include using namespace std; int arr[1000001];int n;void swap(int a, int b){ int tmp=arr[a]; arr[a]=arr[b]; arr[b]=tmp; return;}int partition(int low, int high){ int pivotidx=low+(high-low)/2; int pivotval=arr[pivotidx]; swap(pivotidx, high);//pivot을 오른쪽으로 보내줌 int stridx=low; for(int i=low; i arr[i]; quick_sort(0,n-1); for(int i=0; i
//https://www.acmicpc.net/problem/2576 #include using namespace std; int main(){ int num[7]; int sum=0; int mn=101; for(int i=0; i> num[i]; if(num[i]%2) { sum+=num[i]; if(num[i]
