1208. [S/W 문제해결 기본] 1일차 - Flatten

출처

https://swexpertacademy.com/main/solvingProblem/solvingProblem.do

SW Expert Academy

 

간단한 정렬 문제 sort() 내림차순 방법 까먹지 말 것

 

 

#include<iostream>
#include<algorithm>
#include<vector>


using namespace std;

vector<int> vec;

bool compare (int num1, int num2)
{
	return num1>num2;
}

int main(void)
{
	
	
	for(int tc = 1; tc <= 10; tc++)
	{
		int dump;
		cin >> dump;
		
		vec.clear();
		
		for(int i = 0; i<100; i++)
		{
			int num;
			cin >> num;
			vec.push_back(num);
		}
		
		
		sort(vec.begin(),vec.end(),compare);
		
		for(int i = 0; i <dump; i++)
		{
			vec[0]--;
			vec[99]++;
			sort(vec.begin(),vec.end(),compare);
		}
		
		cout<<"#"<<tc<<" "<<vec[0]-vec[99]<<endl;
	}
	
	
}