제출 #220580

#제출 시각아이디문제언어결과실행 시간메모리
220580LittleFlowers__Exhibition (JOI19_ho_t2)C++14
100 / 100
59 ms3580 KiB
#include <bits/stdc++.h> using namespace std; #define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;}) mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); int rnd(int l,int r){return l+rng()%(r-l+1);} #define fasty ios_base::sync_with_stdio(0),cin.tie(0); #define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a) #define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a) #define forv(a,b) for(auto&a:b) #define fi first #define se second #define pb push_back #define ii pair<int,int> #define mt make_tuple #define all(a) a.begin(),a.end() #define reset(f, x) memset(f, x, sizeof(f)) #define bit(x,i) ((x>>(i-1))&1) #define on(x,i) (x|(1ll<<(i-1))) #define off(x,i) (x&~(1<<(i-1))) #define gg exit(0); const int N=100010; int n,m; ii a[N]; int b[N]; main(){ #define task "Exh" //freopen(task".inp","r",stdin); //freopen(task".out","w",stdout); n=in, m=in; forinc(i,1,n) a[i]={in,in}, swap(a[i].fi,a[i].se); forinc(i,1,m) b[i]=in; sort(a+1,a+n+1); sort(b+1,b+m+1); int j=n,ret=0; fordec(i,m,1){ while(j && a[j].se>b[i]) j--; if(j){ ret++; j--; } } cout<<ret; }

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

joi2019_ho_t2.cpp:28:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...