Pagini recente » Cod sursa (job #3152187) | Cod sursa (job #2094204) | Cod sursa (job #1881273) | Cod sursa (job #2033847) | Cod sursa (job #18397)
Cod sursa(job #18397)
#include<fstream.h>
ifstream f("tricouri.in");
ofstream g("tricouri.out");
long a[1600],s,n,i,j,l;
int x[1600],m,k,p,d;
int max()
{long max=0,s1=0,f=0,e;
for(int i=1;f<=k;i++)
if(x[i]==1) {f++; if(x[i+1]==0) {s1=s-a[i]+a[i+1];
if(s1>max) {max=s1; e=i;}
}
}
s=s1;
return e;
}
void r()
{long u;
f>>n>>m;
for(i=1;i<=n;i++)
{f>>u;
for(j=1;j<=n&&j<1600;j++)
if(u>a[j]) {d++;
for(l=d;l>=j;l--)
a[l+1]=a[l];
a[l+1]=u;
j=n+1;
}
} }
int main()
{r();
for(i=1;i<=m;i++)
{s=0;
f>>k>>p;
for(l=1;l<=k;l++)
{s=s+a[l]; x[l]=1;}
for(j=1;j<=d&&s%p!=0;j++)
{int t=max();
a[t]=a[t+1];
x[t]=0; x[t+1]=1;
}
if(s%p==0) g<<s;
else g<<-1;
}
return 0;
}