oj.uz

답안 #991946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
991946 2024-06-03T12:39:50 Z elesis Gym Badges (NOI22_gymbadges) C++14
0 / 100
 278 ms 15964 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pii pair<int,int>
bool cmp(pii a ,pii b)
{
	return a.ff < b.ff;
}
void solve()
{
	int n;
	cin>>n;
	vector <int> x(n),l(n);
	vector <pii> a(n);
	for(int i=0;i<n;i++)
	{
		cin>>x[i];
		a[i].ff = x[i];
	}
	for(int i=0;i<n;i++)
	{
		cin>>l[i];
		a[i].ss = l[i];
	}
	sort(a.begin(),a.end());
	int cur = 0;
	int ans = n;
	for(int i=0;i<n;i++)
	{
		cur += a[i].ff;
		if(cur>l[0])
		{
			ans = i;
			break;
		}
		//cout << cur << " " << ans << "\n";
	}
	cout << ans << "\n";
}
signed main()
{
	solve();
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 278 ms 15964 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -