This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
bool comp(pll val1, pll val2)
{
return val1.first > val2.first;
}
int main()
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll l, n;
cin >> l >> n;
vector<pll> persons(n);
for (ll i = 0; i < n; i++)
cin >> persons[i].first >> persons[i].second;
sort(persons.begin(), persons.end(), comp);
//lis
set<double> lis;
for (ll i = 0; i < n; i++)
{
double val = l / (double)persons[i].second + persons[i].first;
auto it = lis.lower_bound(val);
if (it != lis.end())
lis.erase(it);
lis.insert(val);
}
cout << lis.size();
return 0;
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |