(D3)8500. 극장 좌석

·2023년 5월 20일

SWEA

목록 보기
43/46

출처 :sw expert academy

👉 Java

import java.util.Scanner;
import java.io.FileInputStream;
import java.util.Arrays;

class Solution
{
	public static void main(String args[]) throws Exception
	{

		Scanner sc = new Scanner(System.in);
		int T;
        int cnt;
		T=sc.nextInt();
        int[] num;
		for(int test_case = 1; test_case <= T; test_case++)
		{
            cnt = 0;
            int n = sc.nextInt();
            num = new int[n];
            for (int i = 0; i < n ; i++){
				num[i] = sc.nextInt();
               // System.out.println(integer[i]);
            }
            Arrays.sort(num);
            for ( int i = 0; i< n; i++){
                if( i == n-1){
                    cnt += num[i]*2+1;
                }else{
                    cnt += num[i]+1;
                }
            }
           
            System.out.println('#'+String.valueOf(test_case)+' '+cnt);

		}
	}
}

👉 python

T = int(input())

for test_case in range(1, T + 1):
    N = int(input())
    mlist = list(map(int, input().split()))
    mlist.sort()
    cnt = 0
    for i in range(len(mlist)):
        if i == N-1 :
            cnt+= mlist[i]*2+1
        else :
            cnt+=mlist[i]+1

    print('#' + str(test_case), cnt)
profile
🐥

0개의 댓글