[소프티어] 우물 안 개구리 자바 풀이 레벨3 단순구현

[소프티어] 우물 안 개구리 자바 풀이 레벨3 단순구현

 

 

https://softeer.ai/practice/6289

Softeer - 현대자동차그룹 SW인재확보플랫폼

 

 

 

전체 코드

import java.io.*;
import java.util.*;

public class Main {

    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        StringBuilder sb = new StringBuilder();
        
        StringTokenizer st = new StringTokenizer(br.readLine());
        int n = Integer.parseInt(st.nextToken());
        int m = Integer.parseInt(st.nextToken());

        st = new StringTokenizer(br.readLine());
        int[] w = new int[n];
        for(int i=0; i<n; i++){
            w[i] = Integer.parseInt(st.nextToken());
        }

        int[][] f = new int[m][2];
        for(int i=0; i<m; i++){
            st = new StringTokenizer(br.readLine());
            f[i][0] = Integer.parseInt(st.nextToken());
            f[i][1] = Integer.parseInt(st.nextToken());
        }

        boolean[] best = new boolean[n];
        for(int i=0; i<n; i++){
            best[i] = true;
        }
        
        for(int j=0; j<m; j++){ // 친분관계 돌면서
            int a = w[f[j][0]-1];
            int b = w[f[j][1]-1];
            if(a==b){
                best[f[j][0]-1] = false;
                best[f[j][1]-1] = false;
            }
            else if(a>b){
                // best[f[m][0]-1] == false;
                best[f[j][1]-1] = false;
            }
            else if(a<b){
                best[f[j][0]-1] = false;
                // best[f[m][1]-1] == false;
            }
        }

        int dap = 0;
        for(int i=0; i<n; i++){
            if(best[i] == true){
                //System.out.println(i + " ");
                dap++;
            }
        }
        
        sb.append(dap);
        bw.write(sb.toString());
        bw.flush();
        bw.close();
    }
}