Pagini recente » Cod sursa (job #446146) | Cod sursa (job #1466466) | Cod sursa (job #2299005) | Cod sursa (job #2476385) | Cod sursa (job #561386)
Cod sursa(job #561386)
#include<iostream>
#include<fstream.h>
using namespace std;
int sorta(long a[100],int n)
{int aux,i,j;
for(i=1;i<=n;i++)
{j=i-1;
while((j>0)&&(a[j-1]<a[j]))
{aux=a[j-1];
a[j-1]=a[j];
a[j]=aux;
j--;}}
}
int main()
{int n,i;
long long1[100],rasp[6000],s,suma=0,k;
ifstream f("loto.in",ios::in);
ofstream g("loto.out",ios::out);
f>>n;
f>>s;
for(i=0;i<n;i++)
f>>long1[i];
for(i=n-1;i>=0;i--)
{suma=suma+long1[i];
rasp[k]=long1[i];
k++;}
i=2*n-3;
k=n-1;
while(suma!=s)
{suma=suma+long1[k];
if(suma>s)
{suma=suma-long1[k];
k--;}
else {rasp[i]=long1[k];
i++;}
if(k<0)
{suma=s;i=0;rasp[i]=-1;}
}
k=k+n;
sorta(rasp,i-1);
for(k=i-1;k>=0;k--)
g<<rasp[k]<<" ";
f.close();
g.close();
}