제출 #1221469

#제출 시각아이디문제언어결과실행 시간메모리
1221469brover29Exhibition (JOI19_ho_t2)C++17
50 / 100
178 ms4664 KiB
#include <bits/stdc++.h> //N8H+R!dg!ZZ5=+6 using namespace std; using ll = int; const ll N=1005; #define f first #define s second ll n,m,dp[N][N]; ll b[N]; ll ans; pair<ll,ll>a[N]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin>>n>>m; for(ll i=1;i<=n;i++){ cin>>a[i].s>>a[i].f; }sort(a+1,a+1+n); for(ll i=1;i<=m;i++){ cin>>b[i]; }sort(b+1,b+1+m); for(ll i=1;i<=n;i++){ for(ll j=1;j<=m;j++){ dp[i][j]=max(dp[i-1][j],dp[i][j-1]); if(a[i].s<=b[j]){ dp[i][j]=max(dp[i-1][j-1]+1,dp[i][j]); } } }cout<<dp[n][m]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...