| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1284680 | quan606303 | Exhibition (JOI19_ho_t2) | C++20 | 48 ms | 2788 KiB |
/*
* @Author: RMQuan
* @Date: 2025-10-29 03:33:48
* @Last Modified by: RMQuan
* @Last Modified time: 2025-10-29 03:37:44
*/
/*idea :
*/
#include <bits/stdc++.h>
bool M1;
#define int long long
#define ll long long
#define INTMAX INT_MAX
#define INTMIN INT_MIN
#define LONGMAX LLONG_MAX
#define LONGMIN LLONG_MIN
#define fi first
#define se second
#define memfull(a,b) memset(a,b,sizeof(a));
#define endl '\n'
#define TASK "TEST"
#define file() if (fopen(TASK".inp","r")){freopen(TASK".inp","r",stdin); freopen(TASK".out","w",stdout);}
using namespace std;
const int MOD=1e9+7;
const int maxn=1e5+7;
int b[maxn],n,m;
pair<int,int> a[maxn];
bool cmp(pair<int,int> x,pair<int,int> y)
{
if (x.fi!=y.fi)return x.fi>y.fi;
else return x.se>y.se;
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
file();
cin>>n>>m;
for (int i=1;i<=n;i++)cin>>a[i].se>>a[i].fi;
for (int i=1;i<=m;i++)cin>>b[i];
sort(a+1,a+1+n,cmp);
sort(b+1,b+1+m,greater<int>());
int ans=0;
for (int i=1,j=1;i<=n;i++)
{
if (j<=m&&b[j]>=a[i].se)
{
ans++;
j++;
}
}
cout<<ans;
bool M2;
cerr<<"-------------------------------------------------"<<endl;
cerr<<"Time : "<<clock()<<" ms"<<endl;
cerr<<"Memory : "<<abs(&M2-&M1)/1024/1024<<" MB"<<endl;
cerr<<"-------------------------------------------------"<<endl;
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
