Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package divequengoai;
- import java.util.Scanner;
- import java.util.Arrays;
- public class DiVeQueNgoai
- {
- public static void main(String[] args)
- {
- int n,tx;
- Scanner mk= new Scanner(System.in);
- do
- {
- n= mk.nextInt();
- if(n<0|| n>100)
- {
- System.out.print("\n Erorr!! nhap lai");
- }
- }
- while (n<0|| n>100);
- int []kc= new int[n];
- int []gt= new int[n];
- for(int i=0;i<n;i++)
- {
- kc[i]= mk.nextInt();
- if(kc[i]<0)
- {
- System.out.print("\nErorr!!"); break;
- }
- }
- for(int i=0;i<n;i++)
- {
- gt[i]= mk.nextInt();
- if(gt[i]<0)
- {
- System.out.print("\nErorr!!"); break;
- }
- }
- tx= gt[0]*kc[0];
- int t= gt[0];
- double dg= (double) gt[0]/kc[0];
- for(int i=1;i<n;i++)
- {
- double k= (double)gt[i]/kc[i];
- if(k >=dg)
- {
- tx= tx +t*kc[i];
- }
- else
- {
- dg= (double)gt[i]/kc[i];
- tx =tx +gt[i]*kc[i];
- t= gt[i];
- }
- }
- System.out.format("\n%d \n", tx);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement