[SWEA]1208 Flatten

Posted by kyoungIn on March 12, 2019

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

풀이

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include <iostream>
#include <vector>
using namespace std;

int main(){
    for(int idx=1;idx<=10;idx++){
        int dump;
        cin >> dump;
        vector<int> v(101,0);
        for(int i=1;i<101;i++){
            int high; cin >> high;
            v[high]++;
        }
        int h=100,l=1;
        while(dump>0){
            for(int i=h;i>0;i--){
                if(v[i]==0) continue;
                else{
                    v[i]-=1;
                    v[i-1]+=1;
                    h= i;
                    break;
                }
            }
            for(int i=l;i<=100;i++){
                if(v[i]==0) continue;
                else {
                    v[i]-=1;
                    v[i+1]+=1;
                    l= i;
                    break;
                }
            }
            dump--;
        }
        
        for(int i=100;i>0;i--){
            if(v[i]==0) continue;
            else{
                h= i;
                break;
            }
        }
        for(int i=1;i<=100;i++){
            if(v[i]==0) continue;
            else {
                l= i;
                break;
            }
        }
        cout <<'#' << idx << ' ' <<h-l << '\n';

    }
}