제출 #234095

#제출 시각아이디문제언어결과실행 시간메모리
234095super_j6Exhibition (JOI19_ho_t2)C++14
0 / 100
5 ms384 KiB
#include <iostream> #include <cstdio> #include <algorithm> #include <vector> using namespace std; #define endl '\n' #define ll long long #define pi pair<int, int> #define f first #define s second const int maxn = 100000; int n, m; pi a[maxn]; int b[maxn]; vector<int> v; int main(){ ios::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for(int i = 0; i < n; i++) cin >> a[i].s >> a[i].f; for(int i = 0; i < m; i++) cin >> b[i]; sort(a, a + n, greater<pi>()); sort(b, b + m, greater<int>()); for(int i = 0; i < n; i++){ int it = upper_bound(v.begin(), v.end(), a[i].s, greater<int>()) - v.begin(); if(it >= m || a[i].s > b[it]) continue; if(it < v.size()) v[it] = a[i].s; else v.push_back(a[i].s); } cout << v.size() << endl; return 0; }

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

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:33:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(it < v.size()) v[it] = a[i].s;
            ~~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...