模拟一下即可
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
//freopen("in.txt","r",stdin);
int n,c;
while(cin>>n>>c){
int sum=0;
int sum1=0;
int point[60];
int t[60];
for(int i=0;i<n;i++) cin>>point[i];
for(int i=0;i<n;i++) cin>>t[i];
int timee=0;
for(int i=0;i<n;i++){
timee+=t[i];
sum+=max(0,point[i]-c*timee);
}
timee=0;
for(int i=n-1;i>=0;i--){
timee+=t[i];
sum1+=max(0,point[i]-c*timee);
}
if(sum<sum1) cout<<"Radewoosh"<<endl;
else if(sum>sum1) cout<<"Limak"<<endl;
else cout<<"Tie"<<endl;
}
}