제출 #643470

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

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
//#ifndef EVAL
//#include "grader.h"
//#endif
#define Baytoro_MayrambekovOrz void solve()
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
int binpow(int a,int n){
	if(n==0)
		return 1;
	if(n%2==1)
		return binpow(a, n-1)*a;
	else{
		int b=binpow(a, n/2);
		return b*b;
	}
}
bool cmp(pair<int,int> a, pair<int,int> b){
	return a.sc<b.sc;
}
int a,b,c,n,m,i,j,k,x,y,cnt=0,sum=0,res=0;
Baytoro_MayrambekovOrz{
	cin>>n>>m;
	vector<pair<int,int>> vec(n);
	vector<int> r(m);
	for(i=0;i<n;i++)
		cin>>vec[i].fr>>vec[i].sc;
	for(i=0;i<m;i++)
		cin>>r[i];
	sort(all(vec),cmp);
	sort(all(r));
	int id=m-1;
	res=0;
	for(i=n-1;i>=0 && id>=0;i--){
		if(r[id]>=vec[i].fr){
			id--;
			res++;
		}
	}
	cout<<res<<endl;
}
main(){
	ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}

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

joi2019_ho_t2.cpp:55:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   55 | main(){
      | ^~~~
joi2019_ho_t2.cpp: In function 'void fopn(std::string)':
joi2019_ho_t2.cpp:18:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:19:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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