Daddy's Journey to Platinum

There are n children who want to go to a Ferris wheel, and your task is to find a gondola for each child.

Each gondola may have one or two children in it, and in addition, the total weight in a gondola may not exceed xx. You know the weight of every child.

What is the minimum number of gondolas needed for the children?

The first input line contains two integers n and x: the number of children and the maximum allowed weight.

The next line contains n integers p_1,p_2,…,p_n: the weight of each child.

Print one integer: the minimum number of gondolas.

4 10
7 2 3 9

3

• 1 <= n <= 2x1e5  
• 1 <= x <= 1e9 
• 1 <= p_i <= x

무게를 입력받아서 정렬하고, 앞쪽(left)와 뒤쪽(right) 아이의 몸무게를 합쳐서 제한무게와 비교한다.

작으면, 곤돌라 하나에 탑승시키고(left+1, right-1), 무거우면 무거운 아이 혼자 타도록 한다.(right-1)  

There are n applicants and m free apartments. Your task is to distribute the apartments so that as many applicants as possible will get an apartment.

Each applicant has a desired apartment size, and they will accept any apartment whose size is close enough to the desired size.

The first input line has three integers n, m, and k: the number of applicants, the number of apartments, and the maximum allowed difference.

The next line contains n integers a_1,a_2,…,a_n: the desired apartment size of each applicant. If the desired size of an applicant is x, he or she will accept any apartment whose size is between x−k and x+k.

The last line contains mm integers b_1,b_2,…,b_m: the size of each apartment.

Print one integer: the number of applicants who will get an apartment.

4 3 5
60 45 80 60
30 60 75

2

• 1 <= n,m <= 2x10^5
• 0 <= k <= 10^9 
• 1 <= a_i, b_i <= 10^9

아파트 크기와 원하는 크기를 입렵 받아서 작은 순서로 정렬한다.

원하는 크기와 감당할 수 있는 크기차이와 주어진 아파트의 크기를 비교해서, 가능한 방들을 출력한다.

You are given a list of n integers, and your task is to calculate the number of distinct values in the list.

The first input line has an integer n: the number of values.

The second line has n integers x_1,x_2,…,x_n 

Print one integers: the number of distinct values.

5
2 3 2 2 3

2

• 1 <= n <= 2x10^5
• 1 <= x_i <= 10^9

입력을 읽어 들여서 set에 입력하여 중복을 제거하고,  set size를 출력한다.