Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.003 s | 0 KBi |
#2 |
Correcto
|
0.007 s | 8 KBi |
#3 |
Correcto
|
0.001 s | 0 KBi |
#4 |
Correcto
|
0.003 s | 0 KBi |
#5 |
Correcto
|
0.004 s | 0 KBi |
#6 |
Correcto
|
0.005 s | 31 KBi |
#7 |
Correcto
|
0.004 s | 0 KBi |
#8 |
Correcto
|
0.004 s | 6 KBi |
#9 |
Correcto
|
0.001 s | 0 KBi |
#10 |
Correcto
|
0.003 s | 0 KBi |
#11 |
Correcto
|
0.003 s | 16 KBi |
#12 |
Correcto
|
0.051 s | 1 KBi |
#13 |
Correcto
|
0.181 s | 2 KBi |
#14 |
Correcto
|
0.081 s | 1 KBi |
#15 |
Correcto
|
0.056 s | 1 KBi |
#16 |
Correcto
|
0.183 s | 1 KBi |
#17 |
Correcto
|
0.194 s | 3 KBi |
#include <bits/stdc++.h> #define REP(i,n) for(int i=0; i<n;i++) #define pb push_back #define ff first #define ss second #define ii pair<int,int> #define vi vector<int> #define vii vector<ii> #define lli long long int #define fast_io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); using namespace std; ostream& operator<<(ostream& os, const vector<int> &v){ for(auto const &i: v){ os<<i<<" "; } os<<endl; return os; } const lli mod=(1e9)+7; const int N = 1e4+1; int main(){ fast_io; int n,c;cin>>n; vi nums(n); REP(i,n)cin>>nums[i]; cin>>c; while(c--){ int k;cin>>k; auto it = upper_bound(nums.begin(),nums.end(),k); cout<<it-nums.begin()<<endl; } return 0; }