Comments

• 
  

  -1

  

  Nguyen_Van_Tien_ccp012  commented on Aug. 24, 2024, 2:22 a.m.

  include <iostream>

  using namespace std;

  int main() { int n;cin >> n; int a[n]; for (int i = 0;i < n;i++) { cin >> a[i]; } int m1 = 0,m2 = 0; for (int i = 0;i < n;i++) { if (m1 < a[i]) m1 = a[i]; else if (m1 == a[i]) m2 = m1; } for (int i = 0;i < n;i++) { if (m2 < a[i] && a[i] != m1) m2 = a[i]; } cout << m1 << " " << m2 << endl; }

• 
  

  -5

  

  Itachi  commented on April 29, 2024, 11:06 a.m.

  include<bits/stdc++.h>

  using namespace std; int main(){

  int n;
  cin>>n;
  int a[n];
  for(int i=1;i<=n;i++){
      cin>>a[i];
  }
  sort(a+1,a+n+1);
  cout<< a[n]<<" "<< a[n-1];
  return 0;
  

  }

  This comment is hidden due to too much negative feedback. Show it anyway.

• 
  

  -1

  

  xuanthinh  commented on April 28, 2024, 1:44 a.m.

  Mn có thể tham khảo code của mình :

  include <bits/stdc++.h>

  using namespace std;

  define ll long long

  ll maxx1=0,maxx2=0,n,x; int main() { iosbase::syncwith_stdio(false); cin.tie(NULL); cin>>n; for(int i=0; i<n; i++) { cin>>x; if(x>=maxx1) { maxx2=maxx1; maxx1=x; } else if(x>=maxx2) { maxx2=x; } } cout<<maxx1<<" "<<maxx2<