Everything is great about Ilya's city, except the roads. The thing is, the only ZooVille road is represented as n holes in a row. We will consider the holes numbered from 1 to n, from left to right.
Ilya is really keep on helping his city. So, he wants to fix at least k holes (perharps he can fix more) on a single ZooVille road.
The city has m building companies, the i-th company needs ci money units to fix a road segment containing holes with numbers of at least li and at most ri. The companies in ZooVille are very greedy, so, if they fix a segment containing some already fixed holes, they do not decrease the price for fixing the segment.
Determine the minimum money Ilya will need to fix at least k holes.
The first line contains three integers n, m, k (1 ≤ n ≤ 300, 1 ≤ m ≤ 105, 1 ≤ k ≤ n). The next m lines contain the companies' description. The i-th line contains three integers li, ri, ci (1 ≤ li ≤ ri ≤ n, 1 ≤ ci ≤ 109).
Print a single integer — the minimum money Ilya needs to fix at least k holes.
If it is impossible to fix at least k holes, print -1.
Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.
10 4 6 7 9 11 6 9 13 7 7 7 3 5 6
17
10 7 1 3 4 15 8 9 8 5 6 8 9 10 6 1 4 2 1 4 10 8 10 13
2
10 1 9 5 10 14
-1
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[303][303];
ll num[303][303];
const ll inf=0x123456789ABCDE;
int main(){
ll m,n,i,j,k,a,b,c,ans=inf,s;
for(i=0;i<=302;i++){
fill(num[i],num[i]+302,inf);
fill(dp[i],dp[i]+302,inf);
}
dp[0][0]=0ll;
cin>>n>>m>>s;
while(m--){
cin>>a>>b>>c;
num[a-1][b]=min(num[a-1][b],c);
}
for(i=1;i<=n;i++){
for(j=n;j>=i;j--){
num[i+1][j]=min(num[i+1][j], num[i][j]);
num[i][j-1]=min(num[i][j-1], num[i][j]);
}
}
/*for(i=0;i<=n;i++){
for(j=0;j<=n;j++) cout<<num[i][j]<<' ';
cout<<endl;
}*/
for(i=1;i<=n;i++){
for(j=0;j<=i;j++){
dp[i][j]=dp[i-1][j];
for(k=0;k<i;k++){
dp[i][j]=min(dp[i][j],dp[k][j-i+k]+num[k][i]);
}
}
}
/*for(i=1;i<=n;i++){
for(j=1;j<=n;j++) cout<<dp[i][j]<<' ';
cout<<endl;
}*/
for(i=n;i>=s;i--) ans=min(ans,dp[n][i]);
cout<<(ans==inf?-1:ans)<<endl;
}