Pagini recente » Cod sursa (job #1464773) | Cod sursa (job #464312) | Cod sursa (job #657086) | Cod sursa (job #252908) | Cod sursa (job #1368198)
#include <fstream>
using namespace std;
ifstream fin("joc7.in");
ofstream fout("joc7.out");
int a[5001],b[5001];
int main()
{int n,k,m,i,aux,nr,max,ordonat,j,x,p;
fin>>n>>k>>m;
max=0;
for(i=1;i<=k;i++)
{fin>>a[i]>>b[i];
if(a[i]<=n&&b[i]>max) max=b[i];
}
ordonat=0;
while(ordonat==0)
{ordonat=1;
for(i=1;i<=k-1;i++)
if(a[i]>a[i+1])
{aux=a[i];a[i]=a[i+1];a[i+1]=aux;
aux=b[i];b[i]=b[i+1];b[i+1]=aux;
ordonat=0;
}
}
nr=1;i=0;p=0;
while(max<m&&i<=k)
{i++;
if(b[i]==max) {nr++;max=0;x=b[i];
for(j=i;j<=k;j++)
if(a[j]<=x) if (b[j]>max) {max=b[j];p=j;if(max>=m) break;}
if(a[j]>x) break;
}
if(a[p+1]>max) break;
}
fout<<max<<" "<<nr;
fin.close();
fout.close();
return 0;
}