【CodeForces 777E】 Hanoi Factory（贪心+sort+模拟）



E. Hanoi Factory

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Of course you have heard the famous task about Hanoi Towers, but did you know that there is a special factory producing the rings for this wonderful game? Once upon a time, the ruler of the ancient Egypt ordered the workers of Hanoi Factory to create as high tower as possible. They were not ready to serve such a strange order so they had to create this new tower using already produced rings.

There are n rings in factory's stock. The i-th ring has inner radius a_i, outer radius b_i and height h_i. The goal is to select some subset of rings and arrange them such that the following conditions are satisfied:

• Outer radiuses form a non-increasing sequence, i.e. one can put the j-th ring on the i-th ring only if b_j ≤ b_i.
• Rings should not fall one into the the other. That means one can place ring j on the ring i only if b_j > a_i.
• The total height of all rings used should be maximum possible.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of rings in factory's stock.

The i-th of the next n lines contains three integers a_i, b_i and h_i (1 ≤ a_i, b_i, h_i ≤ 10⁹, b_i > a_i) — inner radius, outer radius and the height of the i-th ring respectively.

Output

Print one integer — the maximum height of the tower that can be obtained.

Examples

input

3
1 5 1
2 6 2
3 7 3

output

6

input

4
1 2 1
1 3 3
4 6 2
5 7 1

output

4

Note

In the first sample, the optimal solution is to take all the rings and put them on each other in order 3, 2, 1.

In the second sample, one can put the ring 3 on the ring 4 and get the tower of height 3, or put the ring 1 on the ring 2 and get the tower of height 4.

题目大意：n个环，给出内圈半径、外圈半径、高度，将环套放，要求下外半径 >= 上外半径，下内半径  < 上外半径，问最大高度。

思路：先按外半径从大到小排序，外相同内半径从大到小。开始简单依次模拟，wa了

5 6 8
6 7 1
3 8 9
17      像这组数据。后来用栈模拟就好了。

#include<bits/stdc++.h>
#define manx 100005
typedef long long LL;
using namespace std;
struct R
{
    LL out,in,h;
}a[manx];
bool cmp(R a,R b)
{
    if(a.out==b.out) return a.in > b.in;
    return a.out > b.out;
}
stack<R>s;
int main()
{
    LL n;
    scanf("%I64d",&n);
    for (int i=0; i<n; i++)
        scanf("%I64d%I64d%I64d",&a[i].in,&a[i].out,&a[i].h);
    sort(a,a+n,cmp);
    s.push(a[0]);
    LL cnt=s.top().h,ans=0;
    for (int i=1; i<n; i++){
        if(s.empty()){
            cnt=a[i].h;
            s.push(a[i]);
            continue;
        }
        R t=s.top();
        if(a[i].out > t.in){
            cnt+=a[i].h;
            s.push(a[i]);
        }
        else{
            ans=max(ans,cnt);
            while(a[i].out <= t.in && !s.empty()){
                cnt-=t.h;
                s.pop();
                if(!s.empty()) t=s.top();
            }
            cnt+=a[i].h;
            s.push(a[i]);
        }
    }
    ans=max(ans,cnt);
    printf("%I64d\n",ans);
    return 0;
}