[C++/SWEA] 1208. [S/W 문제해결 기본] 1일차 - Flatten (D3)

 

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AV139KOaABgCFAYh&categoryId=AV139KOaABgCFAYh&categoryType=CODE&problemTitle=&orderBy=RECOMMEND_COUNT&selectCodeLang=CCPP&select-1=3&pageSize=10&pageIndex=1

SW Expert Academy

 

ez

swea는 난이도가 들쑥날쑥이라더니 맞는 말인 것 같다

이 문제는 D2보다 쉬운듯

 

나의 풀이

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

int main(int argc, char** argv)
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	// freopen("input (3).txt", "r", stdin);
	int test_case;
	int T = 10;
	int dump = 0;
	int num = 0;
	int answer = 0;
	// cin >> T;
	for(test_case = 1; test_case <= T; ++test_case)
	{
		vector<int> v;
		cin >> dump;
		for (int i = 0; i < 100; ++i){
			cin >> num;
			v.push_back(num);
		}
		for (int i = 0; i < dump; ++i){
			int maxi = max_element(v.begin(), v.end()) - v.begin();
			int mini = min_element(v.begin(), v.end()) - v.begin();
			v[maxi] -= 1;
			v[mini] += 1;
		}
		answer = *max_element(v.begin(), v.end()) - *min_element(v.begin(), v.end());
		cout << "#" << test_case << " " << answer << "\n";
	}
	return 0;
}