백준알고리즘 4344번 java
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); double arr[]; double average = 0; double sum = 0; for (int i = 0; i<n; i++) { int num = sc.nextInt(); int index = 0; sum = 0; average = 0; double score[]; score = new double[num]; arr = new double[num]; for (int j = 0; j<num; j++) { if (sc.hasNextInt()) { arr[j] = sc.nextInt(); sum += arr[j]; score[j] = arr[j]; } } average = sum / num; for (int k = 0; k<num; k++) { if (score[k] > average) { index++; } } double rate = (double)index / num * 100; System.out.printf("%.3f", rate); System.out.println("%"); } } }
'SW > 백준알고리즘' 카테고리의 다른 글
백준알고리즘 10871번 java (0) | 2017.09.13 |
---|---|
백준알고리즘 1546번 java (0) | 2017.09.13 |
백준알고리즘 1110번 java (0) | 2017.09.13 |
백준알고리즘 4673번 java (0) | 2017.09.13 |
백준알고리즘 1065번 java (0) | 2017.09.13 |