Winter Day12: minimum-cost flow problem

Cost flow that is based on network flow, all add to the cost of each edge

Augmenting path: its maximum flow rate depends on the augmented minimal traffic on the road side. Short-board effect, depending on the maximum capacity of the shortest board. 　　

 

Questions surface:

You are given N weighted open intervals. The ith interval covers (ai, bi) and weighs wi. Your task is to pick some of the intervals to maximize the total weights under the limit that no point in the real axis is covered more than k times.

Input
The first line of input is the number of test case.
The first line of each test case contains two integers, N and K (1 ≤ K ≤ N ≤ 200).
The next N line each contain three integers ai, bi, wi(1 ≤ ai < bi ≤ 100,000, 1 ≤ wi ≤ 100,000) describing the intervals.
There is a blank line before each test case.

Output
For each test case output the maximum total weights in a separate line.

View Code

 

data range:

Sample Input
4

3 1
1 2 2
2 3 4
3 4 8

3 1
1 3 2
2 3 4
3 4 8

3 1
1 100000 100000
1 2 3
100 200 300

3 2
1 100000 100000
1 150 301
100 200 300


Sample Output
14
12
100000
100301

 

Meaning of the questions:

 

 

 

 

 

 

Interval k coverage problem POJ Intervals