Submission #881372

#TimeUsernameProblemLanguageResultExecution timeMemory
881372tsumondaiExhibition (JOI19_ho_t2)C++14
100 / 100
40 ms7076 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define fi first #define se second #define pb push_back #define mp make_pair #define foru(i, l, r) for(int i = l; i <= r; i++) #define ford(i, r, l) for(int i = r; i >= l; i--) #define __TIME (1.0 * clock() / CLOCKS_PER_SEC) typedef pair<int, int> ii; typedef pair<ii, int> iii; typedef pair<ii, ii> iiii; const int N = 1e5 + 5; const int oo = 1e9, mod = 1e9 + 7; int n, m, c[N]; ii arts[N]; ii sastify[N]; void process() { cin >> n >> m; foru(i,1,n) { cin >> arts[i].se >> arts[i].fi; } foru(i,1,m) cin >> c[i]; sort(arts+1, arts+1+n, greater<ii>()); sort(c+1, c+1+m, greater<int>()); int ans=1; foru(i,1,n) { if (arts[i].se <= c[ans]) ans++; } cout << ans-1; return; } signed main() { cin.tie(0)->sync_with_stdio(false); //freopen(".inp", "r", stdin); //freopen(".out", "w", stdout); process(); cerr << "Time elapsed: " << __TIME << " s.\n"; return 0; } /* Xét các trường hợp đặc biệt Kiểm tra lại input/output Cố gắng trâu Lật ngược bài toán Keep calm and get VOI Flow: */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...