Tickets HDU - 1260 简单dp

#include<iostream>
using namespace std;
const int N=1e5;
int T,n;
int a[N],b[N];
int dp[N];
int main()
{
    cin>>T;
    while(T--)
    {
        cin>>n;
        for(int i=;i<=n;i++)
            cin>>a[i];
        for(int i=;i<=n-;i++)
            cin>>b[i];
        dp[]=a[];
        for(int i=;i<=n;i++)
            dp[i]=min(dp[i-]+a[i],dp[i-]+b[i-]);
        int ss=dp[n]+**;
        int h=ss/;
        ss=ss-h*;
        int m=ss/;
        ss=ss-m*;
        int s=ss;
        printf("%02d:%02d:%02d ",h,m,s);
        if(h<) printf("am");
        else printf("pm");
        printf("\n");
    }
 }