WIKIOI 第3027题和第3008题 线段覆盖2和加工生产调度

我在维基上的账号叫张正阳欢迎访问两道题都是天梯的题3027：Uses math;var a,b,f:array[1..1000]of longint;i,j,k,n,ans:longint;Beginreadln(n);for i:=1to n doread(a[i],b[i],f[i]);//readfor i:=1 to n-1 dofor j:=i+1 to n doif b[i]>b[j] thenbegink:=a[i];a[i]:=a[j];a[j]:=k;k:=b[i];b[i]:=b[j];b[j]:=k;k:=f[i];f[i]:=f[j];f[j]:=k;end; //sortfor i:=2to n dobegink:=0;for j:=1to i-1 doif b[j]<=a[i] then k:=max(k,f[j]);f[i]:=k+f[i];end; //dpans:=0;for i:=1 to n do if(f[i]>ans)then ans:=f[i];writeln(ans);end.3008：#include "stdio.h"#include "iostream"#include "math.h"int main (){int n,j,s1=0,s2=0,i,a[1005],b[1005],min1=100000,min2=100000;scanf("%d\n",&n);for(i=0;i<(n-1);i++){scanf("%d ",&a[i]);if(min1>a[i]) min1=a[i];s1+=a[i];}scanf("%d ",&a[n-1]);if(min1>a[n-1]) min1=a[n-1];s1+=a[n-1];for(j=0;jb[j]) min2=b[j];s2+=b[j];}if(s1>s2) printf("%d",s1+min2);else printf("%d",s2+min1);return 0;}一个用pas写一个用C++写请别太介意。我也想问你道题1214怎么做啊！！！