제출 #493175

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
493175		Karabasan	Exhibition (JOI19_ho_t2)	C++17	0 / 100	1 ms	716 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#define ll long long
#define fast1 ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,avx")
#pragma GCC optimize("unroll-loops")

int n,q,m,a,b;
int dizi[100005];
pair<int,int> p[100005];
int dp[100005];
int dps(int x)
{

}
void solve()
{
    cin>>n>>m;
    for(int i=0;i<n;i++)
        cin>>p[i].second>>p[i].first;
    for(int i=0;i<m;i++)
        cin>>dizi[i];
    sort(dizi,dizi+n);
    reverse(dizi,dizi+n);
    sort(p,p+n);
    reverse(p,p+n);
    int j=0;
    for(int i=0;i<n;i++)
    {
        if(j<=m&&dizi[j]>=p[i].second)
            j++;
    }
    cout<<j;
}
signed main()
{
    memset(dp,-1,sizeof dp);
    fast1
    //freopen ("lca.gir","r",stdin);
    //freopen ("lca.cik","w",stdout);
    int t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

joi2019_ho_t2.cpp: In function 'int dps(int)':
joi2019_ho_t2.cpp:17:1: warning: no return statement in function returning non-void [-Wreturn-type]
   17 | }
      | ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 40
• Subtask 3: 0 / 50