Pagini recente » Cod sursa (job #1882589) | Istoria paginii monthly-2014/runda-3/clasament | Cod sursa (job #2752287) | Cod sursa (job #1829946) | Cod sursa (job #3150852)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("transport.in");
ofstream fout("transport.out");
int med;
void caut(vector<int> v, int y, int n){
int st = 1, dr = 16000;
int ans = 1;
while(st <= dr){
med = (st + dr) / 2;
if(y < med){
dr = med - 1;
}
else{
st = med + 1;
}
}
}
int main(){
int n, k;
vector<int> v;
fin>>n>>k;
for(int i = n; i >= 1; i--){
int x;
fin>>x;
v.push_back(x);
}
while(!v.empty()){
caut(v, v.back(), n);
v.pop_back();
}
fout<<med;
return 0;
}