1일차-Flattern

1208문제

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
using namespace std;

int main(void)
{

	//priority_queue<int, vector<int>, less<int>> pq;

	//for (int i = 10; i >= 0; i--)	pq.push(i);

	//pq.push(5);

	for (int i = 0; i < 10; i++)
	{
		int iFirstLine;
		cin >> iFirstLine;
		vector<int> vCon;

	

		vCon.reserve(101);
		for (int j = 0; j < 100; j++)
		{
			int iTemp; cin >> iTemp;
			vCon.emplace_back(iTemp);
		}

		int iMax;
		int iMin;
		for (int j = 0; j < iFirstLine; j++)//평탄화 작업
		{
			sort(vCon.begin(), vCon.end(), [](int a, int b) {
				return a > b;
			});//내림차순 정렬입니다.
			vCon[0] = vCon[0] - 1;
			vCon[99] = vCon[99] + 1;
		}
		
		sort(vCon.begin(), vCon.end(), [](int a, int b) {
			return a > b;
		});

			int Max = vCon[0];
			int Min = vCon[99];

			cout << "#" << i + 1 << " " <<Max - Min << endl;

	}
	return 0;
}