Logo
(追記) (追記ここまで)

24855번 - Natives 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 512 MB20313812869.189%

문제

Captain Cook and his team were captured by island natives. Not to be eaten, the adventurers must give some treasures to natives. It turned out that the captain has $n$ treasures.

Chieftain of the natives agrees to let the captain and his team go, if they give him at least half of his treasures. All treasures look pretty to him, so the chieftain agrees to get any treasures, he only wants to get at least half of them.

But actually each treasure has its own value known to Cook. The value of the $i$-th treasure is $a_i$. Help the captain to decide which treasures he should give to the chieftain so that the total value of the treasures he keeps to himself is maximum possible.

입력

The first line of input contains integer $n$ (2ドル \le n \le 1000$).

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ (1ドル \le a_i \le 1000$).

출력

Output one integer --- the maximum possible total value of treasures that the captain can keep for himself after he gives at least half of his treasures to the natives.

제한

예제 입력 1

6
2 4 1 3 3 5

예제 출력 1

12

힌트

출처

Olympiad > Russian Olympiad in Informatics > Russia Team High School Programming Contest > Russia Team High School Programming Contest 2021 A번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /