Comparsion_of_Two_Soln
0 removals
| Words removed | 0 |
| Total words | 387 |
| Words removed (%) | 0.00 |
103 lines
0 additions
| Words added | 0 |
| Total words | 387 |
| Words added (%) | 0.00 |
103 lines
// ---------------------------------TEMPLATE ENDS~---------------------------------
// ---------------------------------TEMPLATE ENDS~---------------------------------
// OPTIMIZATIONS
// OPTIMIZATIONS
#pragma GCC optimize("Ofast,03")
#pragma GCC optimize("Ofast,03")
#pragma GCC target("sse4,avx,avx2,fma")
#pragma GCC target("sse4,avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimization("unroll-loops")
// HEADERS AND NAMESPACE
// HEADERS AND NAMESPACE
#include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
using namespace std;
//CONSTANTS
//CONSTANTS
const int mod = 1000000007;
const int mod = 1000000007;
// const int mod = 998244353;
// const int mod = 998244353;
// COMMONLY USED TYPES
// COMMONLY USED TYPES
typedef long long ll;
typedef long long ll;
typedef long double ld;
typedef long double ld;
typedef vector<int> vi;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ll> vll;
typedef pair<int, int> pi;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, ll> pl;
typedef vector<pi> vpi;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pl> vpl;
//LOOPS
//LOOPS
#define FOR(i, l, r) for (int i = l; i <= (r); i++)
#define FOR(i, l, r) for (int i = l; i <= (r); i++)
#define F0R(i, n) for (int i = 0; i < (n); i++)
#define F0R(i, n) for (int i = 0; i < (n); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a); i >= 0; i--)
#define F0Rd(i, a) for (int i = (a); i >= 0; i--)
#define trav(x, a) for (auto &x : a)
#define trav(x, a) for (auto &x : a)
//SHORT HAND
//SHORT HAND
#define pb push_back
#define pb push_back
#define mp make_pair
#define mp make_pair
#define fi first
#define fi first
#define se second
#define se second
#define sz(a) int((a).size())
#define sz(a) int((a).size())
#define fill(x, y) memset(x, y, sizeof(y))
#define fill(x, y) memset(x, y, sizeof(y))
#define all(x) (x).begin(), (x).end() //Forward traversal
#define all(x) (x).begin(), (x).end() //Forward traversal
#define endl "\n"
#define endl "\n"
#define max(a, b) (a < b ? b : a)
#define max(a, b) (a < b ? b : a)
#define min(a, b) ((a > b) ? b : a)
#define min(a, b) ((a > b) ? b : a)
ll gcd(ll a, ll b)
ll gcd(ll a, ll b)
{
{
return b ? gcd(b, a % b) : a;
return b ? gcd(b, a % b) : a;
}
}
#define watch(x) cout << (#x) << " is : " << (x) << "\n"
#define watch(x) cout << (#x) << " is : " << (x) << "\n"
#define watch2(x, y) cout << (#x) << " is " << (x) << " and " << (#y) << " is " << (y) << "\n"
#define watch2(x, y) cout << (#x) << " is " << (x) << " and " << (#y) << " is " << (y) << "\n"
// First Variable Needs to be Ans like ans = max(ans,xyz)
// First Variable Needs to be Ans like ans = max(ans,xyz)
template <class T>
template <class T>
bool ckmin(T &a, const T &b)
bool ckmin(T &a, const T &b)
{
{
return b < a ? a = b, 1 : 0;
return b < a ? a = b, 1 : 0;
}
}
template <class T>
template <class T>
bool ckmax(T &a, const T &b)
bool ckmax(T &a, const T &b)
{
{
return a < b ? a = b, 1 : 0;
return a < b ? a = b, 1 : 0;
}
}
// BE COOL AND FOCUS ON ACCURATE & SIMPLE CODE!
// BE COOL AND FOCUS ON ACCURATE & SIMPLE CODE!
// ---------------------------------TEMPLATE ENDS~---------------------------------
// ---------------------------------TEMPLATE ENDS~---------------------------------
// All Variables Here
// All Variables Here
// All Functions Here
// All Functions Here
void solve()
void solve()
{
{
ll n;
ll n;
cin >> n;
cin >> n;
vi a(n, 0);
vi a(n, 0);
for (auto &x : a)
for (auto &x : a)
{
{
cin >> x;
cin >> x;
}
}
sort(all(a));
sort(all(a));
ll ans = 0;
ll ans = 0;
FOR(i, 0, n - 1)
FOR(i, 0, n - 1)
{
{
ans = max(ans, a[i] * (n - i));
ans = max(ans, a[i] * (n - i));
}
}
cout << ans << endl;
cout << ans << endl;
return;
return;
}
}
int main()
int main()
{
{
ios_base::sync_with_stdio(false);
ios_base::sync_with_stdio(false);
cin.tie(0);
cin.tie(0);
// If No Test Case, Then Comment it!
// If No Test Case, Then Comment it!
int tc = 1;
int tc = 1;
// cin >> tc;
// cin >> tc;
while (tc--)
while (tc--)
{
{
solve();
solve();
}
}
return 0;
return 0;
}
}