1260: Sales

Problem Link

#Solution

#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,t;
cin>>t;
while(t–){
cin>>n;
vector<int>a,b;
vector<double>nw;

for(int i=0;i<n;i++)
{int x;
cin>>x;
a.push_back(x);
}
int m=a.size();
int co=0;
for(int i=0;i<m;i++)
{
for(int j=i+1;j<m;j++)
{
if(a[i]<=a[j])
co++;
}

}
cout<<co<<endl;
}return 0;

}

Advertisements

About waprogramming

I am in CSE,from CUET
This entry was posted in Uncategorized and tagged , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s