求调

#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <cmath>
#define int long long
using namespace std;
int k[1000010],d[1000010],a[1000010],n,l[1000010];
int mx=-1111;
int mxn; 
signed main(){
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		scanf("%lld/%lld/%lld",&k[i],&d[i],&a[i]);
		if(k[i]-d[i]>=10){
			l[i]=k[i]*(k[i]-d[i])+a[i];
		}
		else if(k>=d){
			l[i]=(k[i]-d[i]+1)*3+a[i];
		}
		else{
			l[i]=a[i]*2;
		}
		if(mx<l[i]){
			mx=l[i];
			mxn=i;
		}
	}
	cout<<mxn;
	return 0;
}