谁拿了最多奖学金
来源:互联网 发布:怎样选择windows版本 编辑:程序博客网 时间:2024/06/12 01:04
var
s:string;
east,gb:array[0..100]of boolean;
nam:array[0..100]of string;
sum:array[1..100]of longint;
a:array[0..100,1..2]of longint;
l:array[0..100]of longint;
i,j,n,max,ans,b:longint;
maxs:string;
begin
readln(n);
for i:=1 to n do
begin
readln(s);
b:=pos(' ',s);
nam[i]:=copy(s,1,b-1);
delete(s,1,b);
b:=pos(' ',s);
val(copy(s,1,b-1),a[i,1]);
delete(s,1,b);
b:=pos(' ',s);
val(copy(s,1,b-1),a[i,2]);
delete(s,1,b);
if s[1]='Y' then gb[i]:=true;
if s[1]='N' then gb[i]:=false;
delete(s,1,2);
if s[1]='Y' then east[i]:=true;
if s[1]='N' then east[i]:=false;
delete(s,1,2);
val(copy(s,1,2),l[i]);
end;
for i:=1 to n do
begin
if (a[i,1]>80)and(l[i]>=1) then sum[i]:=sum[i]+8000;
if (a[i,1]>85)and(a[i,2]>80) then sum[i]:=sum[i]+4000;
if (a[i,1]>90) then sum[i]:=sum[i]+2000;
if (a[i,1]>85)and(east[i]) then sum[i]:=sum[i]+1000;
if (a[i,2]>80)and(gb[i]) then sum[i]:=sum[i]+850;
end;
maxs:='';
max:=-1;
for i:=1 to n do
begin
ans:=ans+sum[i];
if sum[i]>max then begin max:=sum[i]; maxs:=nam[i]; end;
end;
writeln(maxs);
writeln(max);
write(ans);
end.
s:string;
east,gb:array[0..100]of boolean;
nam:array[0..100]of string;
sum:array[1..100]of longint;
a:array[0..100,1..2]of longint;
l:array[0..100]of longint;
i,j,n,max,ans,b:longint;
maxs:string;
begin
readln(n);
for i:=1 to n do
begin
readln(s);
b:=pos(' ',s);
nam[i]:=copy(s,1,b-1);
delete(s,1,b);
b:=pos(' ',s);
val(copy(s,1,b-1),a[i,1]);
delete(s,1,b);
b:=pos(' ',s);
val(copy(s,1,b-1),a[i,2]);
delete(s,1,b);
if s[1]='Y' then gb[i]:=true;
if s[1]='N' then gb[i]:=false;
delete(s,1,2);
if s[1]='Y' then east[i]:=true;
if s[1]='N' then east[i]:=false;
delete(s,1,2);
val(copy(s,1,2),l[i]);
end;
for i:=1 to n do
begin
if (a[i,1]>80)and(l[i]>=1) then sum[i]:=sum[i]+8000;
if (a[i,1]>85)and(a[i,2]>80) then sum[i]:=sum[i]+4000;
if (a[i,1]>90) then sum[i]:=sum[i]+2000;
if (a[i,1]>85)and(east[i]) then sum[i]:=sum[i]+1000;
if (a[i,2]>80)and(gb[i]) then sum[i]:=sum[i]+850;
end;
maxs:='';
max:=-1;
for i:=1 to n do
begin
ans:=ans+sum[i];
if sum[i]>max then begin max:=sum[i]; maxs:=nam[i]; end;
end;
writeln(maxs);
writeln(max);
write(ans);
end.
0 0
- 谁拿了最多奖学金
- 谁拿了最多奖学金
- 谁拿了最多奖学金
- 谁拿了最多奖学金
- 谁拿了最多奖学金
- 谁拿了最多奖学金
- tyvj P1002:谁拿了最多奖学金
- 1147. 谁拿了最多奖学金
- 谁拿了最多的奖学金
- Sicily 1147. 谁拿了最多奖学金
- 【模拟】谁拿了最多奖学金
- sicily--1147. 谁拿了最多奖学金
- vijos P1001 谁拿了最多奖学金
- 【模拟】谁拿了最多奖学金
- 1147. 谁拿了最多奖学金
- 1147. 谁拿了最多奖学金
- 1147[谁拿了最多奖学金]
- P1001 谁拿了最多奖学金
- Android控件架构
- Docker部署WordPress LNMP(Nginx PHP MySQL)环境实践
- java.io.File类注意
- 宇宙总统
- mysql group by分组,根据一个字段分组 ,又想得到另一个字段的最大或者最小。如何解决。
- 谁拿了最多奖学金
- ajax跨域
- hdfs中snapshot的解释
- 豆瓣模拟登陆
- 大索引技术大数据的未来
- JavaScript中的原型Prototype【1】
- Boostrap的栅格系统与自己额外定义的媒体查询的冲突
- 关于对new和delete的认识
- 订单统计