Submission #6423837

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#define MOD 1000000007
#define mkp make_pair
typedef long long ll;
using namespace std;

int N;

int main(){
  cin>>N;
  vector<ll> W(N);
  for(int i=0;i<N;i++) cin>>W[i];

  int ans=0;
  bool used[51]={};
  for(int i=0;i<N;i++){
      if(used[i]) continue;
      int now=W[i];
      used[i]=true;
      ans++;
      for(int j=i+1;j<N;j++){
          if(used[j]) continue;
          if(W[j]<=now){
              now=W[j];
              used[j]=true;
          }
      }
  }

  cout<<ans<<endl;

  return 0;
}

Submission Info

Judge Result