RiseOJ는 solved.ac와 제휴 관계가 없습니다. 티어 아이콘 © solved.ac. solved.ac
포럼
COCI00511

Kisik

Unrated 레이팅 미적용
난이도
1s
시간 제한
256MB
메모리 제한
0
맞았습니다!!
0
제출 수
0.0%
정답률
레이팅

의견: 0

설명

2 \(s / 128\) \(MB / 90\) points

The Colonial Alliance of Intergalactic Nations (CAIN) has decided to build a town on Mars for \(K\)

families. It is therefore necessary to build a total of \(K\) buildings, one for each family. For each family,

one of \(N\) different building designs that were prepared by the best architects in the universe will be

selected. All buildings are of rectangular shape, and the i ^{th} building is \(W\) {i} units wide and \(H\) units high.

In addition, due to the variety promoted by CAIN, all families will get different designs.

Buildings are built next to each other, so that their bottom sides lie on the same line. After

construction, the city needs to be filled with air, so the city will be enclosed by a huge glass wall that

will keep the air inside. The wall will also be of a rectangular shape with sides parallel to the building

sides.

Since maintaining air on Mars is expensive, your job is to choose a single assignment between all

possible ones in a way that will require the least amount of air (one unit of air is required to supply

unit sized square).

A possible city from the first sample test, which only needs 20 air units.
We chose not to build the building which is 3 units wide.

제약

In the test samples totally worth 40 points \(N\) will be less than or equal to 1 000.

2 \(s / 128\) \(MB / 90\) points

입력 형식

The first line contains two integers \(N\) and \(K\) from the task description (1 ≤ \(K\)\(N\) ≤ 1 000 000).
In the next \(N\) lines there are two integer numbers \(W\) {i}{ } and \(H\) {i}{ }, width and height of the i {th}{ } building
(1 ≤ \(W\) {i}{ } { }, \(H\) { } ≤ 1 000 000). All the pairs ( \(W\) { }, \(H\) ) will be mutually different.}_{

출력 형식

Write the minimum amount of air in the first line.

예제 1
입력
4 3
2 3
2 2
1 4
3 2
출력
20
예제 2
입력
3 3
1 1
3 3
2 2
출력
18
예제 3
입력
4 1
6 4
4 5
19 1
3 6
출력
18
문제 정보

생성자가 기록되지 않았습니다.

출처 COCI 2018/2019 Contest 4

평가 및 의견

Kisik

개요
출제자 난이도 Unrated 레이팅 미적용 의견 0 / 50 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.

풀이 제출

Kisik

게스트로 둘러보고 있습니다. 로그인하면 풀이를 제출하고 진행 상황을 확인할 수 있습니다. 로그인하고 제출하기
공개
C++20 Tab 들여쓰기 · Ctrl+/ 주석 토글 · Enter 자동 들여쓰기
1 1 1 0 공백: 4 · UTF-8