Pagini recente » Cod sursa (job #2447356) | Cod sursa (job #1268812) | Cod sursa (job #2742035) | Cod sursa (job #2739726) | Cod sursa (job #18721)
Cod sursa(job #18721)
#include <iostream.h>
#include <fstream.h>
int main()
{
int N,M,P,K,i,j,k,aux,s,smax;
int v[300000],x[100];
ifstream f("tricouri.in");
ofstream g("tricouri.out");
f>>N>>M;
for (i=3; i<=N; i++)
f>>v[i];
for (i=3; i<=N; i++)
for (j=3; j<=N; j++)
if (v[j]>=v[j+1])
{
aux=v[j];
v[j]=v[j+1];
v[j+1]=aux;
}
for (i=1; i<=M; i++)
{
f>>K;
f>>P;
}
s=0;
for (i=1; i<=M; i++)
for (j=N; j>=N-K; j--)
{
s=s+v[j];
if (s%P==0 && s!=0) x[i]=s;
}
for (i=1; i<=M; i++)
g<<x[i]<<'\n';
f.close();
g.close();
return 0;
}