Submission #369289

#TimeUsernameProblemLanguageResultExecution timeMemory
369289AriaHExhibition (JOI19_ho_t2)C++11
100 / 100
80 ms5740 KiB
/** Im the best because i work as hard as i possibly can **/ #pragma GCC optimize("O2") #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; typedef pair<int,int> pii; typedef pair<ll,ll> pll; #define all(x) (x).begin(),(x).end() #define F first #define S second #define Mp make_pair #define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define file_io freopen("in.txt" , "r+" , stdin) ; freopen("out.txt" , "w+" , stdout); #define endl "\n" const int N = 1e6 + 10; const ll mod = 1e9 + 7; const ll mod2 = 998244353; const ll inf = 8e18; const int LOG = 22; ll pw(ll a , ll b, ll M) { return (!b ? 1 : (b & 1 ? (a * pw(a * a % M, b / 2, M)) % M : pw(a * a % M, b / 2, M))); } ll n, m, tot, B[N]; pll A[N]; bool cmp(pll a, pll b) { if(a.S == b.S) return a.F < b.F; return a.S < b.S; } int main() { scanf("%lld%lld", &n, &m); for(int i = 1; i <= n; i ++) { scanf("%lld%lld", &A[i].F, &A[i].S); } for(int i = 1; i <= m; i ++) scanf("%lld", &B[i]); sort(A + 1, A + n + 1, cmp); sort(B + 1, B + m + 1); ///for(int i = 1; i <= m; i ++) printf("%d ", B[i]); ///printf("\n"); int j = m; for(int i = n; i >= 1; i --) { if(j > 0 && B[j] >= A[i].F) tot ++, j --; } printf("%lld\n", tot); return 0; }

Compilation message (stderr)

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   39 |  scanf("%lld%lld", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:42:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   42 |   scanf("%lld%lld", &A[i].F, &A[i].S);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:44:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   44 |  for(int i = 1; i <= m; i ++) scanf("%lld", &B[i]);
      |                               ~~~~~^~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...