Pagini recente » Cod sursa (job #125009) | Cod sursa (job #286791) | Cod sursa (job #42568) | Cod sursa (job #271301) | Cod sursa (job #739288)
Cod sursa(job #739288)
#include<fstream>
using namespace std;
int main ()
{
ifstream in("nums.in");
ofstream out("nums.out");
long n,a[100000],b[100000],d[100000],i,j=0,max,c[1000],k=0,p,r;
in>>n;
for(i=0;i<n;i++)
in>>a[i]>>b[i];
for(i=0;i<n;i++){
if(a[i]==0){d[j]=b[i];j++;for(r=0;r<j;r++){if(d[r]>d[r+1]){p=d[r];d[r]=d[r+1];d[r+1]=p;}for(r=0;r<j;r++){if(d[r]==d[r+1]){d[r]=d[j];j--;}for(r=0;r<j;r++){if(d[r]>d[r+1]){p=d[r];d[r]=d[r+1];d[r+1]=p;}}
if(a[i]==1){c[k]=d[b[i]];k++;}}
for(i=0;i<k+1;i++)
out<<d[i];
return 0;
}