C++ :

#include<bits/stdc++.h>
using namespace std;
long long n,k,t;
int main()
{
    cin>>n;
    while(n--)
    {
    	long long a=0,b=0,c=0;
    	cin>>k;
    	if(k==1)cin>>a>>b,t+=(a+b)*2;
    	if(k==2)cin>>a,t+=a*4;
    	if(k==3)cin>>a>>b>>c,t+=a+b+c;
	}
	cout<<t;
    return 0;
}

Pascal :

var i,j,t,a,b,c,n:longint;
    sum:qword;
begin
  readln(n);
  sum:=0;
  for i:=1 to n do
  begin
    read(t);
    case t of
      1: begin
           read(a);readln(b);
           sum:=sum+(a+b)*2;
         end;
      2: begin
           readln(a);
           sum:=sum+a*4;
         end;
      3: begin
           readln(a,b,c);
           sum:=sum+a+b+c;
         end;
    end;
  end;
  writeln(sum);
end.