-
Notifications
You must be signed in to change notification settings - Fork 35
/
1009A - Game Shopping.cpp
102 lines (95 loc) · 2.58 KB
/
1009A - Game Shopping.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
/*Saurav Paul*/
#include<bits/stdc++.h>
#define endl '\n'
#define ll long long int
#define loop(i,a,b) for(ll i=a;i<=b;++i)
#define boost ios_base::sync_with_stdio(0);
#define eb emplace_back
#define mp make_pair
#define clr(x) x.clear()
#define MOD 1e9+7
#define itoc(c) ((char)(((int)'0')+c))
#define ctoi(c) ((int)(((int)c)-'0'))
#define all(p) p.begin(),p.end()
#define iscn(num) scanf("%d",&num);
#define scn(num) scanf("%lld",&num);
#define scn2(num,num2) scanf("%lld%lld",&num,&num2);
using namespace std;
///////////////////////
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef PAUL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define dbg(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
////////////////////////
template<typename T>T set_bit(T N,T pos){return N=N | (1<<pos);}
template<typename T>T reset_bit(T N,T pos){return N= N & ~(1<<pos);}
template<typename T> bool check_bit(T N,T pos){return (bool)(N & (1<<pos));}
template<typename T>void bin_print(T N){bitset<25>bit(N);cerr<<bit.to_string()<<"\n";}
template<typename T> void max_self(T &a, T b){
a=max(a,b);
}
template <typename T > void min_self(T &a, T b){
a=min(a,b);
}
template <typename T > void add_self(T &a, T b){
a+=b;
}
////////////////////////
template<typename T> void ara_read(T &v,ll n){
ll temp;
for(ll i=0; i< n; i++){
scanf("%lld",&temp);
v.emplace_back(temp);
}
}
template<typename T> void ara_print(T &v){
for(ll x : v)
printf("%lld ",x);
puts("");
}
////////////////////////
const ll INF = 2e18 + 99;
typedef pair<ll,ll> Pair;
typedef vector<ll> vec;;
int main()
{
int n,m;
scanf("%d%d",&n,&m);
vector <int> cost,wallet;
ara_read(cost,n);
ara_read(wallet,m);
int i=0, j=0 , cnt=0;
while(i<n && j<m){
if(cost[i] <= wallet[j]){
j++;
cnt++;
}
i++;
}
printf("%d\n",cnt);
return 0;
}