Submission #1352645

#TimeUsernameProblemLanguageResultExecution timeMemory
1352645hyyhArea (NOI23_area)C++20
100 / 100
0 ms344 KiB
#include <iostream>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <iomanip>
#include <set>
#include <bitset>
#include <unordered_map>

using namespace std;
using ll = long long;
using pii = pair<int,int>;
using piii = tuple<int,int,int>;
#define f first
#define s second
#define endl '\n'
#define all(x) begin(x),end(x)

int main(){
    int n;cin >> n;
    int ans = 0;
    for(int i{};i < n;i++){
        int a,b;cin >> a >> b;
        ans = max(ans,a*b);
    }
    cout << ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...