Pagini recente » Cod sursa (job #2548253) | Cod sursa (job #3000029) | Cod sursa (job #1898980) | Cod sursa (job #356899) | Cod sursa (job #2049147)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
int n,w,e[10005],c[10005];
void sortare(int a[],int b[],int n)
{int k,x,i,j;
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
if(e[i]>e[j]){
k=e[i];
e[i]=e[j];
e[j]=k;
x=c[i];
c[i]=c[j];
c[j]=x;
}
}
int main()
{
fin>>n>>w;
for(int i=1;i<=n;i++)
{
fin>>e[i]>>c[i];
}
sortare(e,c,n);
int mini=c[1];
if(e[n]<w)fout<<-1;
else
{for(int i=1;i<=n;i++)
if(e[i]>=w&&c[i]<=mini)mini=c[i];
fout<<mini;}
}