๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
Algorithm

[Codeforces] 1316A: Grade Allocation

by ์ฃผ๋ฐœ2 2020. 4. 7.
๋ฐ˜์‘ํ˜•

https://codeforces.com/problemset/problem/1316/A

 

Problem - 1316A - Codeforces

 

codeforces.com

์ฝ”๋“œ

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		
		int t = scan.nextInt();
		for(int tc=0; tc<t; tc++) {
			int n = scan.nextInt();	// ํ•™์ƒ ์ˆ˜
			int m = scan.nextInt();	// ํ•™์ƒ์ด ๋ฐ›์„ ์ˆ˜ ์žˆ๋Š” ์ตœ๋Œ€์คจ์ˆ˜
			int sum = 0;	// ๋ชจ๋“  ํ•™์ƒ์˜ ์ ์ˆ˜ ํ•ฉ
			int ans = 0;	// ์ •๋‹ต
			int[] arr = new int[n];
			for(int i=0; i<n; i++) {
				arr[i] = scan.nextInt();
				sum += arr[i];
			}
			
			ans = (sum>=m) ? m : sum;
			System.out.println(ans);
		}
		scan.close();
	}

}

ํ’€์ด

๋ชจ๋“  ํ•™์ƒ ์ ์ˆ˜์˜ ํ•ฉ์ด m๋ณด๋‹ค ํฌ๊ฑฐ๋‚˜๊ฐ™์œผ๋ฉด m์„, ๋ฏธ๋งŒ์ด๋ฉด sum์„ ์ถœ๋ ฅ

 

 

๋ฐ˜์‘ํ˜•

๋Œ“๊ธ€