# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
886438 | vjudge1 | Gym Badges (NOI22_gymbadges) | C++17 | 157 ms | 17212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,abm,mmx,sse4.2,fma,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define int uint64_t
#define PB push_back
#define sqr(a) ((a)*(a))
#define I insert
#define F first
#define S second
bool cmp(pair<int,int> const&a, pair<int,int> const&b) {
return make_pair(a.S, a.F) < make_pair(b.S, b.F);
}
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
int n;
cin>>n;
vector<pair<int,int>> a(n);
for(int i=0; i<n; i++) cin>>a[i].S;
for(int i=0; i<n; i++) cin>>a[i].F;
sort(a.begin(), a.end());
if(a[0].F==a[n-1].F) {
sort(a.begin(), a.end(), cmp);
int ans = 0, cur = 0;
for(int i=0; i<n; i++) {
if(cur <= a[0].F) {
cur += a[i].S;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |