Submission #136791

#	Time	Username	Problem	Language	Result	Execution time	Memory
136791		ekrem	Exhibition (JOI19_ho_t2)	C++98	100 / 100	157 ms	6656 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define coc g[node][i]
#define sol (k+k)
#define sag (k+k+1)
#define orta ((bas+son)>>1)
#define mod 1000000007
#define inf 1000000009
#define N 1000005

using namespace std;

typedef long long ll;
typedef pair < int , int > ii;

int n, m, ind = 1, k, a[N], c[N], ne[N];
ii b[N];
set < ii > s;

int main(){
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	scanf("%d %d",&n ,&m);
	for(int i = 1; i <= n; i++){
		scanf("%d %d",&b[i].st ,&b[i].nd);
		// s.insert(mp(b[i].nd, i));
		// cout << b[i].nd << " ";
	}
	sort(b + 1, b + n + 1);
	for(int i = 1; i <= n; i++)
		s.insert(mp(b[i].nd, i));
	ind = n;
	for(int i = 1; i <= m; i++)
		scanf("%d",a + i);
	sort(a + 1, a + m + 1);
	// reverse(a + 1, a + m + 1);
	// cout << "geldi" << endl;
	for(int i = m; i >= 1; i--){
		while(ind >= 1 and b[ind].st > a[i]){
			// cout << "geldi " << b[ind].nd << endl;
			s.erase(mp(b[ind].nd, ind));
			ind--;
		}
		if(!s.empty()){
			ii ek = *s.rbegin();
			// cout << ek.st << " buldum" << endl;
			c[++k] = ek.st;
			s.erase(ek);
		}
	}
	printf("%d\n", k);
	return 0;
}

Compilation message (stderr)

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:26:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n ,&m);
  ~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:28:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&b[i].st ,&b[i].nd);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:37:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",a + i);
   ~~~~~^~~~~~~~~~~~

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