From 66485932595b90f53072f3031586c63f211e098a Mon Sep 17 00:00:00 2001
From: rl544 <111494264+rl544@users.noreply.github.com>
Date: Thu, 8 Dec 2022 16:39:05 +0900
Subject: [PATCH] =?UTF-8?q?uploaded=20at=202022.=2012.=208.=20=EC=98=A4?=
 =?UTF-8?q?=ED=9B=84=204:39:03?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 programmers/과일 장수/solution.java | 29 +++++++++++++++++++++++++++++
 1 file changed, 29 insertions(+)
 create mode 100644 programmers/과일 장수/solution.java

diff --git a/programmers/과일 장수/solution.java b/programmers/과일 장수/solution.java
new file mode 100644
index 0000000..97df207
--- /dev/null
+++ b/programmers/과일 장수/solution.java	
@@ -0,0 +1,29 @@
+// [문제 링크]: https://school.programmers.co.kr/learn/courses/30/lessons/135808
+
+import java.util.*;
+import java.util.Collections;
+
+class Solution {
+    public static void reverseSort(int[] arr) {
+        Arrays.sort(arr);
+        for (int i = 0; i < arr.length / 2; i++) {
+            int temp = arr[i];
+            arr[i] = arr[arr.length - i - 1];
+            arr[arr.length - i - 1] = temp;
+        }
+    }
+    
+    public int solution(int k, int m, int[] score) {
+        int answer = 0;
+        int len = score.length;
+        int count = len / m;        
+        reverseSort(score);
+        for(int i = 0; i < len; i++){
+            if(i%m == m-1){
+                answer += score[i]*m;
+            }
+        }
+        return answer;
+    }    
+
+}
\ No newline at end of file