제출 #465059

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
465059		jamezzz	Exhibition (JOI19_ho_t2)	C++17	100 / 100	70 ms	4876 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#include <ext/rope>
using namespace __gnu_cxx;

typedef tree<long long, null_type, less<long long>,
rb_tree_tag, tree_order_statistics_node_update> pbds;
//less_equal for identical elements

#ifdef DEBUG
#define dbg(...) printf(__VA_ARGS__);
#else
#define dbg(...)
#endif
#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb emplace_back
#define sz(x) (int)x.size()
#define mnto(x,y) x=min(x,(__typeof__(x))y)
#define mxto(x,y) x=max(x,(__typeof__(x))y)
#define INF 1023456789
#define LINF 1023456789123456789
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<pll> vll;
mt19937 rng(time(0));

int n,m,s,v,c;
vi f;
vii p;

int main(){
	sf("%d%d",&n,&m);
	for(int i=0;i<n;++i){
		sf("%d%d",&s,&v);
		p.pb(v,s);
	}
	for(int i=0;i<m;++i){
		sf("%d",&c);
		f.pb(c);
	}
	sort(all(p));
	sort(all(f));
	while(sz(p)&&sz(f)){
		if(p.back().se<=f.back())f.pop_back();
		p.pop_back();
	}
	pf("%d\n",m-sz(f));
}

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

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:45:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |  sf("%d%d",&n,&m);
      |    ^
joi2019_ho_t2.cpp:47:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |   sf("%d%d",&s,&v);
      |     ^
joi2019_ho_t2.cpp:51:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |   sf("%d",&c);
      |     ^

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