Cod sursa(job #1586874)
| Utilizator | Data | 1 februarie 2016 18:15:06 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int n,i,j,aux,aux2;
int a[150000],b[150000];
void citire()
{
f>>n;
for(i=1;i<=n;i++){
f>>a[i];
f>>b[i];
}
}
int main()
{
citire();
for(i=1;i<n;i++){
for(j=i+1;j<=n;j++){
if(b[i]<b[j]){
aux=b[i];
b[i]=b[j];
b[j]=aux;
aux2=a[i];
a[i]=a[j];
a[j]=aux2;
}
}
}
for(i=1;i<=n;i++){
g<<a[i]<<" "<<b[i]<<'\n';
}
return 0;
}
