22年pasca就告别了
by Shadows @ 2017-03-14 07:54:15
改了之后就40四十分了。
```cpp
var n,m,i,maxx,max,j,k,q:longint;
a,w,b,qwe:array[-500..1000] of longint;
c:array[1..500,1..500] of longint;
begin
readln(n);
readln(m);
for i:=1 to m do
begin
read(a[i]);
if(maxx<a[i]) then maxx:=a[i];
end;
for i:=1 to m do
begin
read(b[i]);
for j:=1 to a[i] do
begin
inc(w[j]);
c[j,w[j]]:=b[i];
end;
end;
for i:=maxx downto 1 do
begin
max:=0;
for j:=1 to w[i] do
if(c[i,j]>max) then max:=c[i,j];
for j:=1 to maxx do
for k:=1 to w[j] do
if(c[j,k]=max) then c[j,k]:=-100;
end;
for i:=1 to maxx do
begin
for j:=1 to w[i] do
begin
if(c[i,j]>0) then inc(qwe[c[i,j]]);
if(qwe[c[i,j]]=1) then q:=q+c[i,j];
end;
end;
write(n-q);
end.
```
by 百里亦守约_test @ 2017-03-14 07:55:20
```cpp
#include <iostream>
#include <algorithm>
using namespace std;
struct node
{
int time;
int fine;
};
bool cmp(node x,node y)
{
return x.fine>y.fine;
}
int main()
{
struct node c[1010];
int n,m,i,j;
cin>>n>>m;
int b[5010];
for(i=1;i<=m;i++)
{
cin>>c[i].time;
b[i]=0;
}
for(i=1;i<=m;i++)
{
cin>>c[i].fine;
}
sort(c+1,c+1+m,cmp);
b[c[1].time]=1;
bool find=false;
int num=0;
for(i=2;i<=m;i++)
{
find=false;
for(j=c[i].time;j>=1;j--)
{
if(b[j] != 1)
{
b[j]=1;
find=true;
break;
}
}
if(!find)
{
num+=c[i].fine;
}
}
cout<<n-num;
return 0;
}
```
by linzr2006 @ 2017-03-22 22:15:29
我是c++的，你自己转换
by linzr2006 @ 2017-03-22 22:17:04
我的AC了
```cpp
var
ans,a,i,j,t:longint;
s:array[1..500] of boolean;
m,n:array[1..500] of longint;
begin
readln(ans);
readln(a);
for i:=1 to a do
read(m[i]);
for i:=1 to a do
read(n[i]);
for i:=1 to a-1 do
for j:=i+1 to a do
if n[i]<n[j] then
begin
t:=m[i];
m[i]:=m[j];
m[j]:=t;
t:=n[i];
n[i]:=n[j];
n[j]:=t;
end;
for i:=1 to a do
begin
j:=m[i];
while s[j] do
begin
j:=j-1;
if j<1 then j:=a;
end;
s[j]:=true;
if j>m[i] then ans:=ans-n[i];
end;
write(ans);
end.
```
by SKTT1Faker @ 2017-08-20 10:54:26
```
有的人活着(c++),他(pasca)已经死了
```
by xhQYm @ 2019-12-11 21:35:20
@[xhQYm](/user/270120) 这句话是这么用的？？？
by whoam @ 2021-12-30 22:36:56